On Best Conditioned Matrices
From MaRDI portal
Cites work
Cited in
(31)- An algorithm for the symmetric generalized eigenvalue problem
- Comparison of linear system solvers applied to diffusion-type finite element equations
- A new method for computing the closed-loop eigenvalues of a discrete-time algebraic Riccati equation
- Conjugate gradient type methods and preconditioning
- HMDR and FMDR algorithms for the generalized eigenvalue problem
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- Optimally scaled matrices, necessary and sufficient conditions
- Optimal block diagonal scaling of block 2-cyclic matrices
- A note on best conditioned preconditioners
- Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
- Best-conditioned circulant preconditioners
- The Newton-arithmetic mean method for the solution of systems of nonlinear equations.
- A small note on the scaling of symmetric positive definite semiseparable matrices
- Solution of real and complex systems of linear equations
- Matrices which can be optimally scaled
- Condition numbers and equilibration of matrices
- A bound for the optimum relaxation factor for the successive overrelaxation method
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- On the Condition Number of Local Bases for Piecewise Cubic Polynomials
- Scaling linear optimization problems prior to application of the simplex method
- scientific article; zbMATH DE number 3246695 (Why is no real title available?)
- On the Effects of Scaling of the Peaceman-Rachford Method
- Some Results on Sparse Matrices
- Reorthogonalization-based stiffness preconditioning in FETI algorithms with applications to variational inequalities.
- Optimal preconditioners of a given sparsity pattern
- Nearly Optimal Block-Jacobi Preconditioning
- Optimally conditioned block matrices
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- Ernst G. Straus (1922-1983)
This page was built for publication: On Best Conditioned Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5848534)
