Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
From MaRDI portal
Publication:4127261
DOI10.2307/2005787zbMath0355.65023OpenAlexW4230129384MaRDI QIDQ4127261
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2005787
Hermitian, skew-Hermitian, and related matrices (15B57) Quadratic and bilinear forms, inner products (15A63) Direct numerical methods for linear systems and matrix inversion (65F05) Canonical forms, reductions, classification (15A21)
Related Items (85)
Backward error and condition number analysis for the indefinite linear least squares problem ⋮ On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges ⋮ Sparse block factorization of saddle point matrices ⋮ BiCGstab(\(l\)) and other hybrid Bi-CG methods ⋮ An inertia-free filter line-search algorithm for large-scale nonlinear programming ⋮ Sparse quadratic programming in chemical process optimization ⋮ A mixed derivative terms removing method in multi-asset option pricing problems ⋮ 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 ⋮ Uncertainty quantification in littoral erosion ⋮ Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems ⋮ Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization ⋮ Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations ⋮ Sparse linear problems and the least squares method ⋮ Class of optimization algorithms for the solution of large nonlinear programming problems. I ⋮ Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices ⋮ Gaussian quadrature for matrix valued functions on the real line ⋮ Experimental study of ILU preconditioners for indefinite matrices ⋮ Componentwise analysis of direct factorization of real symmetric and Hermitian matrices ⋮ On Factoring a Class of Complex Symmetric Matrices Without Pivoting ⋮ Stable and Efficient Computation of Generalized Polar Decompositions ⋮ On the relation between Darboux transformations and polynomial mappings ⋮ Discretization of inherent ODEs and the geometric integration of DAEs with symmetries ⋮ An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices ⋮ A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers ⋮ The foundations of spectral computations via the solvability complexity index hierarchy ⋮ A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices ⋮ Deflation techniques applied on mixed model equations ⋮ Add-sub pivoting triangular factorization for symmetric matrix ⋮ Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations ⋮ Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems ⋮ An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods ⋮ Stability analysis of block factorization for complex symmetric block tridiagonal matrices ⋮ Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions ⋮ A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization ⋮ Bisection for Ax=lambdaBx with matrices of variable band width ⋮ A computational method for the indefinite quadratic programming problem ⋮ Symmetric method of approximate particular solutions for solving certain partial differential equations ⋮ Full block \(J\)-Jacobi method for Hermitian matrices ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization ⋮ The LAPW Method with Eigendecomposition Based on the Hari--Zimmermann Generalized Hyperbolic SVD ⋮ Numerical Analysis of Novel Finite Difference Methods ⋮ An interior eigenvalue problem from electronic structure calculations ⋮ Descent line search scheme using Geršgorin circle theorem ⋮ Stability and inertia ⋮ Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances ⋮ Novel modifications of parallel Jacobi algorithms ⋮ Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots ⋮ New parallel sparse direct solvers for multicore architectures ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices ⋮ Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems ⋮ Modified Cholesky algorithms: A catalog with new approaches ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ On solving sparse symmetric linear systems whose definiteness is unknown ⋮ Spectral theory of the \(G\)-symmetric tridiagonal matrices related to Stahl's counterexample ⋮ Fast direct solvers for some complex symmetric block Toeplitz linear systems ⋮ Indefinite QR factorization ⋮ Block-oriented \(J\)-Jacobi methods for Hermitian matrices ⋮ Photonic band structure calculations using nonlinear eigenvalue techniques ⋮ New implementation techniques for the exterior Stokes problem in the plane ⋮ Decomposition of a symmetric matrix ⋮ Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation ⋮ Curvilinear path steplength algorithms for minimization which use directions of negative curvature ⋮ A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Bibliography on the evaluation of numerical software ⋮ On the use of directions of negative curvature in a modified newton method ⋮ Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting ⋮ Unnamed Item ⋮ Solution of indefinite linear systems using an LQ decomposition for the linear constraints ⋮ A Sparse Symmetric Indefinite Direct Solver for GPU Architectures ⋮ On solving three classes of nonlinear programming problems via simple differentiable penalty functions ⋮ Partial pivoting strategies for symmetric gaussian elimination ⋮ On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems ⋮ Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix ⋮ The Rook's pivoting strategy ⋮ Stable algorithms for solving symmetric and skew-symmetric systems ⋮ Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms ⋮ Inertia-controlling factorizations for optimization algorithms ⋮ An iterative working-set method for large-scale nonconvex quadratic programming ⋮ Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Manifestations of the Schur complement
- Monitoring the numerical stability of Gaussian elimination
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- On the reduction of a symmetric matrix to tridiagonal form
- Partial Pivoting Strategies for Symmetric Matrices
This page was built for publication: Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
