Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
DOI10.1016/J.LAA.2018.12.026zbMATH Open1410.65079arXiv1703.09012OpenAlexW2907389642MaRDI QIDQ1736232FDOQ1736232
Authors: Jan Kuřátko
Publication date: 26 March 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.09012
Recommendations
- Sparse block factorization of saddle point matrices
- The generalized Cholesky factorization method for saddle point problems
- Numerically stable LDLT-factorization of F-type saddle point matrices
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Preordering saddle‐point systems for sparse LDLT factorization without pivoting
dynamical systemssequential quadratic programmingsaddle-point matrixsymmetric indefinite factorization
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Nonlinear programming (90C30)
Cites Work
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical solution of saddle point problems
- Title not available (Why is that?)
- Finite elements in computational electromagnetism
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Accuracy and Stability of Numerical Algorithms
- Computational techniques for hybrid system verification
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- Title not available (Why is that?)
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Stable Finite Elements for Problems with Wild Coefficients
- Title not available (Why is that?)
- Reformulation of Boundary Value Problems into “Standard” Form
- Accurate Symmetric Indefinite Linear Equation Solvers
- Parallel Processing and Applied Mathematics
- Stable Numerical Algorithms for Equilibrium Systems
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Combined global and local search for the falsification of hybrid systems
- A modified Jacobi preconditioner for solving ill-conditioned Biot's consolidation equations using symmetric quasi-minimal residual method
- Numerical experience with iterative methods for equality constrained nonlinear programming problems
- Title not available (Why is that?)
- Interior‐point method for non‐linear non‐convex optimization
Uses Software
This page was built for publication: Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736232)