scientific article; zbMATH DE number 3816913
From MaRDI portal
Publication:3664299
band and envelopedissectionminimum degreenumerical testspositive definite linear systemsquotient treesparse Cholesky decompositionSPARSPAK program package
Software, source code, etc. for problems pertaining to linear algebra (15-04) Factorization of matrices (15A23) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited in
(only showing first 100 items - show all)- Simultaneous selection of variables and smoothing parameters in structured additive regression models
- A comparison of projective and direct solvers for finite elements in elastostatics
- On the use of inexact subdomain solvers for BDDC algorithms
- Bandwidth of bipartite permutation graphs in polynomial time
- Algorithms for the reduction of matrix bandwidth and profile
- Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies
- Derivative generation from multivariate scattered data by functional minimization
- Iterative methods for overflow queueing models. I
- Parallel Cholesky factorization on a shared-memory multiprocessor
- A pipelined Givens method for computing the QR factorization of a sparse matrix
- Parallel triangularization of substructured finite element problems
- Quotient tree partitioning of undirected graphs
- Approximation by cubic C^ 1-splines on arbitrary triangulations
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Linear algebra on high performance computers
- Improving Jacobi and Gauss-Seidel iterations
- A sparse sequential quadratic programming algorithm
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- The analysis of a nested dissection algorithm
- On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations
- Sparse linear problems and the least squares method
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- A direct method for sparse least squares problems with lower and upper bounds
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- Techniques for parallel manipulation of sparse matrices
- Solution of sparse positive definite systems on a hypercube
- Conditioning analysis of positive definite matrices by approximate factorizations
- On symbolic factorization of partitioned sparse symmetric matrices
- LU decompositions of generalized diagonally dominant matrices
- Automated three-dimensional grid refinement on a minicomputer
- Conditioning analysis of sparse block approximate factorizations
- On an instance of the inverse shortest paths problem
- The hierarchical basis multigrid method for convection-diffusion equations
- The average parallel complexity of Cholesky factorization
- Lower eigenvalue bounds for singular pencils of matrices
- Towards a cost-effective ILU preconditioner with high level fill
- A barrier method for dynamic Leontief-type linear programs
- Compact finite difference schemes with spectral-like resolution
- Consistent sparse factorization
- Analytical bounds for block approximate factorization methods
- A parallel projection method for overdetermined nonlinear systems of equations
- A chordal preconditioner for large-scale optimization
- Approximate factorizations with S/P consistently ordered M-factors
- Incomplete factorizations of singular linear systems
- The effect of ordering on preconditioned conjugate gradients
- Preconditioning of the \(p\)-version of the finite element method
- Comparison of two methods for solving linear equations occurring in molecular dynamics applications
- A direct parallel sparse matrix solver
- Domain decomposition preconditioning in the hierarchical \(p\)-version of the finite element method
- A new efficient algorithm for computing Gröbner bases (F₄)
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Basic-set algorithm for a generalized linear complementarity problem
- Analysis and implementation of a dual algorithm for constrained optimization
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations
- An analysis of the composite step biconjugate gradient method
- Solving simultaneous linear equations using recurrent neural networks
- Repeated red-black ordering: A new approach
- Algorithm for random close packing of spheres with periodic boundary conditions
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Graph perturbations
- Computer simulation and modeling in railway applications
- The convergence of parallel iteration algorithms for linear complementarity problems
- A graph-theoretic model of symmetric Givens operations and its implications
- Calculation of incompressible viscous flows by an unconditionally stable projection FEM
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- Fast Cholesky factorization for interior point methods of linear programming
- Separators and structure prediction in sparse orthogonal factorization
- The prolonged adaptive multigrid method for finite element Navier-Stokes equations
- Nonlinear iteration methods for high speed laminar compressible Navier-Stokes equations
- Using domain decomposition to find graph bisectors
- A parallel solver for the hp-version of finite element methods
- A local solution adapted Tri-Tree multigrid generator and iterative equation solver for mixed finite element formulation of the Navier-Stokes equations
- Experimental study of ILU preconditioners for indefinite matrices
- Sparse spatial autoregressions
- Parallel solution techniques in computational structural mechanics
- Sparse matrix tools for Gaussian models on lattices
- Stable, high-order discretization for evolution of the wave equation in 1 + 1 dimensions.
- Conditioning analysis of separate displacement preconditioners for some nonlinear elasticity systems.
- A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields
- A parallel multi-p method
- Approximating the bandwidth via volume respecting embeddings
- A practical algorithm for making filled graphs minimal
- Refining an approximate inverse
- Symbiosis between linear algebra and optimization
- Numerical linear algebra algorithms and software
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
- A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis
- Preconditioning complex symmetric linear systems
- Parametric investigation of the stability of coaxial cylindrical shells containing flowing fluid
- A numerical meshless method of soliton-like structures model via an optimal sampling density based kernel interpolation
- Greedy optimal control for elliptic problems and its application to turnpike problems
- Estimation of spatial autoregressive models with measurement error for large data sets
- A scalable, matrix-free multigrid preconditioner for finite element discretizations of heterogeneous Stokes flow
- A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization
- The danger of combining block red-black ordering with modified incomplete factorizations and its remedy by perturbation or relaxation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664299)
