The Multifrontal Solution of Indefinite Sparse Symmetric Linear
From MaRDI portal
Publication:3662515
DOI10.1145/356044.356047zbMath0515.65022OpenAlexW2063675347MaRDI QIDQ3662515
Publication date: 1983
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/356044.356047
sparse matricesvector processingfrontal methodsgeneralized elementsindefinite symmetric matricesminimum-degree algorithm
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A null space algorithm for mixed finite-element approximations of Darcy's equation ⋮ Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation ⋮ Fast Algorithms for High Frequency Wave Propagation ⋮ GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems ⋮ Logarithmic barriers for sparse matrix cones ⋮ Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations ⋮ Multigrid based preconditioners for the numerical solution of two-dimensional heterogeneous problems in geophysics ⋮ 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 ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ Compressed Absorbing Boundary Conditions via Matrix Probing ⋮ An efficient analyse phase for element problems ⋮ Nested Domain Decomposition with Polarized Traces for the 2D Helmholtz Equation ⋮ Distributed-memory hierarchical interpolative factorization ⋮ Fast Sparse Selected Inversion ⋮ Sparse matrix factorization in the implicit finite element method on petascale architecture ⋮ Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization ⋮ An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations ⋮ Linear optimization over homogeneous matrix cones ⋮ A bubble-inspired algorithm for finite element mesh partitioning ⋮ On the computational efficiency of isogeometric methods for smooth elliptic problems using direct solvers ⋮ A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions ⋮ On the Complexity of the Block Low-Rank Multifrontal Factorization ⋮ Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction ⋮ A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources ⋮ Add-sub pivoting triangular factorization for symmetric matrix ⋮ A hybrid approach to solve the high-frequency Helmholtz equation with source singularity in smooth heterogeneous media ⋮ An Application of Generalized Tree Pebbling to Sparse Matrix Factorization ⋮ Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides ⋮ Full Waveform Inversion and the Truncated Newton Method ⋮ How good are projection methods for convex feasibility problems? ⋮ Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates ⋮ Rankings of graphs ⋮ Newton Like Line Search Method Using q-Calculus ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ An Additive Overlapping Domain Decomposition Method for the Helmholtz Equation ⋮ Bridging the Gap Between Flat and Hierarchical Low-Rank Matrix Formats: The Multilevel Block Low-Rank Format ⋮ Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows ⋮ High scalable non-overlapping domain decomposition method using a direct method for finite element analysis ⋮ An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ A Diagonal Sweeping Domain Decomposition Method with Source Transfer for the Helmholtz Equation ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ Data-Parallel Sparse Factorization ⋮ An algebraic multifrontal preconditioner that exploits the low‐rank property ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ A survey of direct methods for sparse linear systems ⋮ Wavelets in hybrid-mixed stress elements ⋮ Applications of statistical condition estimation to the solution of linear systems ⋮ Recursive Sweeping Preconditioner for the Three-Dimensional Helmholtz Equation ⋮ Domain decomposition approach to flexible multibody dynamics simulation ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Additive Sweeping Preconditioner for the Helmholtz Equation ⋮ Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations ⋮ Multifrontal Computations on GPUs and Their Multi-core Hosts ⋮ Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations ⋮ A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting ⋮ A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows ⋮ Fast algorithms for hierarchically semiseparable matrices ⋮ Perturbation analysis of saddle-point problems ⋮ A Sparse Symmetric Indefinite Direct Solver for GPU Architectures ⋮ Sparse Gaussian Elimination Modulo p: An Update ⋮ Fast Alternating BiDirectional Preconditioner for the 2D High-Frequency Lippmann--Schwinger Equation ⋮ An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ Solving the Cahn-Hilliard variational inequality with a semi-smooth Newton method ⋮ High-performance sampling of generic determinantal point processes ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ Unnamed Item ⋮ Practical Computational Fluid Dynamics with the Finite Volume Method ⋮ Improving Multifrontal Methods by Means of Block Low-Rank Representations ⋮ RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems ⋮ Sparsifying Preconditioner for Pseudospectral Approximations of Indefinite Systems on Periodic Structures ⋮ Sparsifying Preconditioner for the Lippmann--Schwinger Equation ⋮ Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling ⋮ A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure ⋮ A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems ⋮ A multilevel approach for trace system in HDG discretizations ⋮ Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry ⋮ L-sweeps: a scalable, parallel preconditioner for the high-frequency Helmholtz equation ⋮ Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ Trace transfer-based diagonal sweeping domain decomposition method for the Helmholtz equation: algorithms and convergence analysis ⋮ Vertex ranking of asteroidal triple-free graphs ⋮ Full waveform inversion through double-sweeping solver ⋮ State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control ⋮ A fast block low-rank dense solver with applications to finite-element matrices ⋮ 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 ⋮ Numerical integration on GPUs for higher order finite elements ⋮ Performance models and workload distribution algorithms for optimizing a hybrid CPU-GPU multifrontal solver ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Free-surface film flow over topography: full three-dimensional finite element solutions ⋮ Alya: computational solid mechanics for supercomputers ⋮ Concurrent algorithm for integrating three-dimensional B-spline functions into machines with shared memory such as GPU ⋮ A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices ⋮ On the use of a modified Newton method for nonlinear finite element analysis ⋮ A parallel solver for the \(hp\)-version of finite element methods ⋮ Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization ⋮ Refined isogeometric analysis for fluid mechanics and electromagnetics ⋮ Acoustic inverse scattering via Helmholtz operator factorization and optimization ⋮ Solution of sparse positive definite systems on a hypercube ⋮ On the augmented system approach to sparse least-squares problems ⋮ An asynchronous direct solver for banded linear systems ⋮ On PDE solution in transient optimization of gas networks ⋮ Constructing a minimum height elimination tree of a tree in linear time ⋮ A factorization with update procedures for a KKT matrix arising in direct optimal control ⋮ On strictly chordality-\(k\) graphs ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ A parallel multifrontal algorithm and its implementation ⋮ \(\mathcal H\)-LU factorization on many-core systems ⋮ Multiscale modal analysis of fully-loaded spent nuclear fuel canisters ⋮ A fast algorithm for sparse matrix computations related to inversion ⋮ Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs ⋮ \(l_p\)-optimal rankings and max-optimal rankings are different ⋮ A fast direct solver for elliptic problems on general meshes in 2D ⋮ Finding the edge ranking number through vertex partitions ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs ⋮ Arankings of trees ⋮ Parallel computation approaches for flexible multibody dynamics simulations ⋮ Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods ⋮ The design and analysis of the generalized finite element method ⋮ Effective preconditioning through minimum degree ordering interleaved with incomplete factorization ⋮ A parallel direct solver for the self-adaptive \(hp\) finite element method ⋮ A survey on direct solvers for Galerkin methods ⋮ Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots ⋮ New parallel sparse direct solvers for multicore architectures ⋮ A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities ⋮ Refined isogeometric analysis for generalized Hermitian eigenproblems ⋮ Numerical modelling of residual flow and salinity in the Río de la plata ⋮ Sparse Cholesky factorization on FPGA using parameterized model ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ Structured regularization for barrier NLP solvers ⋮ Solving PDEs in non-rectangular 3D regions using a collocation finite element method ⋮ Direct solvers performance on \(h\)-adapted grids ⋮ Fast construction of hierarchical matrix representation from matrix-vector multiplication ⋮ Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems ⋮ Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming ⋮ A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ Accelerating scientific computations with mixed precision algorithms ⋮ Analysis of the solution phase of a parallel multifrontal approach ⋮ Using multiple levels of parallelism to enhance the performance of domain decomposition solvers ⋮ Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients ⋮ Parallel space-time \(hp\) adaptive discretization scheme for parabolic problems ⋮ The method of polarized traces for the 2D Helmholtz equation ⋮ Width, depth, and space: tradeoffs between branching and dynamic programming ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Applications of a hyper-graph grammar system in adaptive finite-element computations ⋮ Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines ⋮ Hypermatrix oriented supernode amalgamation ⋮ A novel primal-mixed finite element approach for heat transfer in solids ⋮ Vector processing in simplex and interior methods for linear programming ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ An optimal parallel algorithm for node ranking of cographs ⋮ The value of continuity: refined isogeometric analysis and fast direct solvers ⋮ Sparsifying preconditioner for the time-harmonic Maxwell's equations ⋮ Parallel algebraic hybrid solvers for large 3D convection-diffusion problems ⋮ Multiprocessing a sparse matrix code on the Alliant FX/8 ⋮ Implementation of hybrid crack element on a general finite element mesh and in combination with XFEM ⋮ Learning dominant wave directions for plane wave methods for high-frequency Helmholtz equations ⋮ Multifrontal parallel distributed symmetric and unsymmetric solvers ⋮ Algorithms for generalized vertex-rankings of partial k-trees ⋮ A review of frontal methods for solving linear systems ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ Inertia-controlling factorizations for optimization algorithms ⋮ An iterative working-set method for large-scale nonconvex quadratic programming ⋮ Computing projections for the Karmarkar algorithm ⋮ On vertex ranking of a starlike graph ⋮ Interconnected hierarchical structures for fast direct elliptic solution ⋮ Solving symmetric indefinite systems in an interior-point method for linear programming ⋮ An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations ⋮ Methods of minimal iterations using a generalized Krylov basis ⋮ Methods for convex and general quadratic programming
Uses Software
