An algorithm for profile and wavefront reduction of sparse matrices
From MaRDI portal
Publication:3736810
DOI10.1002/nme.1620230208zbMath0601.65027OpenAlexW2053087839MaRDI QIDQ3736810
Publication date: 1986
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.1620230208
algorithmfinite elementbandwidth reductionprofile reductionwavefront reductionsmall memorysymmetric pattern of zeros
Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items
Anh-hierarchical adaptive procedure for the scaled boundary finite-element method ⋮ Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure ⋮ HIGH-PERFORMANCE PCG SOLVERS FOR FEM STRUCTURAL ANALYSIS ⋮ Unnamed Item ⋮ A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners ⋮ Unnamed Item ⋮ SIMPLE-type preconditioners for the Oseen problem ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Unnamed Item ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ On large-scale generalized inverses in solving two-by-two block linear systems ⋮ Cholesky decomposition of a positive semidefinite matrix with known kernel ⋮ Finite element nodal ordering algorithms ⋮ A comparison of preconditioners for incompressible Navier-Stokes solvers ⋮ HSL_MI28 ⋮ Two‐dimensional finite element analysis of a synthetically loaded stator in a piezoelectrically driven ultrasonic motor ⋮ Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions ⋮ Nodal ordering for bandwidth reduction using ant system algorithm ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ Some useful strategies for unstructured edge-based solvers on shared memory machines ⋮ Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ Topological aspects of meshless methods and nodal ordering for meshless discretizations ⋮ Parallel computation of two‐dimensional rotational flows of viscoelastic fluids in cylindrical vessels ⋮ Multilevel hybrid spectral element ordering algorithms ⋮ New crash procedures for large systems of linear constraints ⋮ A frontal solver for the 21st century ⋮ Comparative efficiencies of three parallel algorithms for nonlinear implicit transient dynamic analysis ⋮ Unnamed Item ⋮ Preconditioning techniques for large linear systems: A survey
Cites Work
