Factorizing symmetric indefinite matrices

DOI10.1016/0024-3795(76)90071-9zbMath0336.65022OpenAlexW2055605148MaRDI QIDQ1230352

Roger Fletcher

Publication date: 1976

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(76)90071-9

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Quadratic and bilinear forms, inner products (15A63) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (13)

On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ A numerical approximation for the simple bifurcation problems ⋮ The growth factor and efficiency of Gaussian elimination with rook pivoting ⋮ Krylov Subspace Solvers and Preconditioners ⋮ A modified Newton method for minimization ⋮ A method for computing all the zeros of a polynomial with real coefficients ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ On solving three classes of nonlinear programming problems via simple differentiable penalty functions ⋮ Partial pivoting strategies for symmetric gaussian elimination ⋮ Inertia-controlling factorizations for optimization algorithms ⋮ An iterative working-set method for large-scale nonconvex quadratic programming

Cites Work

• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• A Note on the Stability of Gaussian Elimination
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• Unnamed Item

This page was built for publication: Factorizing symmetric indefinite matrices