Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3112812 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Manifestations of the Schur complement
- Monitoring the numerical stability of Gaussian elimination
- On the reduction of a symmetric matrix to tridiagonal form
- Partial Pivoting Strategies for Symmetric Matrices
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
Cited in
(96)- Solution of indefinite linear systems using an LQ decomposition for the linear constraints
- Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations
- Sparse linear problems and the least squares method
- Bisection for Ax=lambdaBx with matrices of variable band width
- A computational method for the indefinite quadratic programming problem
- Decomposition of a symmetric matrix
- Bibliography on the evaluation of numerical software
- Stability of block LDL^T factorization of a symmetric tridiagonal matrix
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- BiCGstab(l) and other hybrid Bi-CG methods
- Experimental study of ILU preconditioners for indefinite matrices
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- The Rook's pivoting strategy
- Uncertainty quantification in littoral erosion
- Descent line search scheme using Geršgorin circle theorem
- 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
- Photonic band structure calculations using nonlinear eigenvalue techniques
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- Inertia-controlling factorizations for optimization algorithms
- An iterative working-set method for large-scale nonconvex quadratic programming
- Gaussian quadrature for matrix valued functions on the real line
- Stability and inertia
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- Symmetric method of approximate particular solutions for solving certain partial differential equations
- Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- Spectral theory of the \(G\)-symmetric tridiagonal matrices related to Stahl's counterexample
- Sparse quadratic programming in chemical process optimization
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices
- 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
- Stability analysis of block factorization for complex symmetric block tridiagonal matrices
- Full block \(J\)-Jacobi method for Hermitian matrices
- An interior eigenvalue problem from electronic structure calculations
- On solving sparse symmetric linear systems whose definiteness is unknown
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- Indefinite QR factorization
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Sparse block factorization of saddle point matrices
- A sparse symmetric indefinite direct solver for GPU architectures
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges.
- A mixed derivative terms removing method in multi-asset option pricing problems
- A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
- Primal and dual active-set methods for convex quadratic programming
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- On the relation between Darboux transformations and polynomial mappings
- On Factoring a Class of Complex Symmetric Matrices Without Pivoting
- Partial pivoting strategies for symmetric gaussian elimination
- Stable algorithms for solving symmetric and skew-symmetric systems
- An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
- Class of optimization algorithms for the solution of large nonlinear programming problems. I
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- On the use of directions of negative curvature in a modified newton method
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- Randomized complete pivoting for solving symmetric indefinite linear systems
- Numerical analysis of novel finite difference methods
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Backward error and condition number analysis for the indefinite linear least squares problem
- Stable and efficient computation of generalized polar decompositions
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- A smooth version of Sylvester's law of inertia and its numerical realization
- The LAPW method with eigendecomposition based on the Hari-Zimmermann generalized hyperbolic SVD
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- A new sparse LDL^T solver using a posteriori threshold pivoting
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- New implementation techniques for the exterior Stokes problem in the plane
- Discretization of inherent ODEs and the geometric integration of DAEs with symmetries
- 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
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- An efficient algorithm for the minimal least squares solution of linear systems with indefinite symmetric matrices
- Spectral transformation for the dense symmetric semidefinite generalized eigenvalue problem
- A normal form algorithm for tensor rank decomposition
- Novel modifications of parallel Jacobi algorithms
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- Well-posedness and numerical simulations of a reactive flow in a heterogeneous porous medium
- Sparse linear least-squares problems
- Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods
- Method for verifying solutions of sparse linear systems with general coefficients
- Block-oriented J-Jacobi methods for Hermitian matrices
- Jordan algebras, hemiplex numbers, and the Cholesky decomposition of arbitrary symmetric matrices
- Linear-cost Polyharmonic Spline Interpolation of Arbitrary Degree
- Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification
- An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Modified Cholesky algorithms: A catalog with new approaches
This page was built for publication: Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127261)
