Factorizing symmetric indefinite matrices

DOI10.1016/0024-3795(76)90071-9zbMATH Open0336.65022OpenAlexW2055605148MaRDI QIDQ1230352FDOQ1230352

Authors: 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

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

Cites Work

• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Title not available (Why is that?)
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• A Note on the Stability of Gaussian Elimination

Cited In (13)

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

This page was built for publication: Factorizing symmetric indefinite matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230352)