The following pages link to MatrixMarket (Q16209):
Displaying 50 items.
- Scientific computations on multi-core systems using different programming frameworks (Q268844) (← links)
- Global simpler GMRES for nonsymmetric systems with multiple right-hand sides (Q298467) (← links)
- Block ILU preconditioners for block-tridiagonal systems (Q351472) (← links)
- A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems (Q351474) (← links)
- A new approach for calculating the real stability radius (Q398622) (← links)
- A gradient based iterative algorithm for solving structural dynamics model updating problems (Q400239) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
- Advances in bio-inspired computing for combinatorial optimization problems (Q494689) (← links)
- Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains. (Q558543) (← links)
- Approximate factoring of the inverse (Q629900) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- A Newton-based method for the calculation of the distance to instability (Q716432) (← links)
- A key to choose subspace size in implicitly restarted Arnoldi method (Q747742) (← links)
- Adaptive version of simpler GMRES (Q849149) (← links)
- Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations (Q904386) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems (Q956687) (← links)
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems (Q964207) (← links)
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices (Q970386) (← links)
- A two-directional Arnoldi process and its application to parametric model order reduction (Q1008656) (← links)
- Constrained graph layout by stress majorization and gradient projection (Q1011768) (← links)
- A new method for computing Moore-Penrose inverse matrices (Q1019812) (← links)
- On correction equations and domain decomposition for computing invariant subspaces (Q1033447) (← links)
- Modified incomplete orthogonal factorization methods using Givens rotations (Q1034737) (← links)
- A compile/Run-time environment for the automatic transformation of linked list data structures (Q1040752) (← links)
- Deflation in Krylov subspace methods and distance to uncontrollability (Q1042596) (← links)
- A toolkit for efficient numerical applications in Java (Q1046170) (← links)
- Multimedia representation of matrix computations and data (Q1394838) (← links)
- The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\). (Q1428609) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems (Q1651310) (← links)
- Preconditioning complex symmetric linear systems (Q1665980) (← links)
- Blankets joint posterior score for learning Markov network structures (Q1687296) (← links)
- Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems (Q1699366) (← links)
- Cucheb: a GPU implementation of the filtered Lanczos procedure (Q1737460) (← links)
- Relaxation strategies for nested Krylov methods (Q1775594) (← links)
- Accelerating the induced dimension reduction method using spectral information (Q1789683) (← links)
- A note on weighted FOM and GMRES for solving nonsymmetric linear systems (Q1827017) (← links)
- Future problem solving environments for computational science (Q1840890) (← links)
- Middleware for the use of storage in communication. (Q1853268) (← links)
- A refined Arnoldi type method for large scale eigenvalue problems (Q1943090) (← links)
- A contour-integral based method for counting the eigenvalues inside a region (Q1999893) (← links)
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations (Q2006553) (← links)
- Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices (Q2009113) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
- A method for computing a few eigenpairs of large generalized eigenvalue problems (Q2085682) (← links)
- Updating the undamped piezoelectric smart structure system with no-spillover (Q2186746) (← links)
