Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
From MaRDI portal
Publication:1736232
Abstract: In this paper we consider the application of direct methods for solving a sequence of saddle-point systems. Our goal is to design a method that reuses information from one factorization and applies it to the next one. In more detail, when we compute the pivoted factorization we speed up computation by reusing already computed pivots and permutations. We develop our method in the frame of dynamical systems optimization. Experiments show that the method improves efficiency over Bunch-Parlett while delivering the same results.
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
Cites work
- scientific article; zbMATH DE number 3874969 (Why is no real title available?)
- scientific article; zbMATH DE number 1193339 (Why is no real title available?)
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 1406968 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A modified Jacobi preconditioner for solving ill-conditioned Biot's consolidation equations using symmetric quasi-minimal residual method
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- Accuracy and Stability of Numerical Algorithms
- Accurate Symmetric Indefinite Linear Equation Solvers
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Combined global and local search for the falsification of hybrid systems
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Computational techniques for hybrid system verification
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Finite elements in computational electromagnetism
- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Interior‐point method for non‐linear non‐convex optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Numerical experience with iterative methods for equality constrained nonlinear programming problems
- Numerical solution of saddle point problems
- Parallel Processing and Applied Mathematics
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Reformulation of Boundary Value Problems into “Standard” Form
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
- Stable Finite Elements for Problems with Wild Coefficients
- Stable Numerical Algorithms for Equilibrium Systems
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
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)
