scientific article

No author found.

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

numerical tests minimum degree positive definite linear systems dissection sparse Cholesky decomposition quotient tree band and envelope SPARSPAK program package

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) 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) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items

Efficient Solution of a Sparse Non-symmetric System of Linear Equations, Sparse matrix methods for unbalanced multifactor analysis of variance and covariance, A finite element method for the two-dimensional extended Boussinesq equations, Unnamed Item, Unstructured meshing for two asset barrier options, Rank-adaptive structure-preserving model order reduction of Hamiltonian systems, Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations, BOUNDS ON BLOCK DIAGONAL PRECONDITIONING, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, Acceleration on stretched meshes with line-implicit LU-SGS in parallel implementation, ARMS: an algebraic recursive multilevel solver for general sparse linear systems, Sparse matrix element topology with application to AMG(e) and preconditioning, A robust incomplete factorization preconditioner for positive definite matrices, A unified set of resequencing algorithms, A robust incomplete factorization based on value and space constraints, Reordering Strategy for Blocking Optimization in Sparse Linear Solvers, Matrix shapes invariant under the symmetric QR algorithm, Linear optimization over homogeneous matrix cones, Stability indicators of nonnegative matrices: parametric and sparse cases, A spectral algorithm for envelope reduction of sparse matrices, Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers, Fast separator decomposition for finite element meshes, New convergence results and preconditioning strategies for the conjugate gradient method, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, Unnamed Item, An Asynchronous Incomplete Block LU Preconditioner for Computational Fluid Dynamics on Unstructured Grids, Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix, Solution of elastoplastic problems of the non-axially symmetric deformation of bodies of revolution, Finite Element Methods for Nonlinearly Viscous Fluids, Sparse matrices, Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems, An algebraic multifrontal preconditioner that exploits the low‐rank property, A survey of direct methods for sparse linear systems, FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture, Unnamed Item, On the ordering of sparse linear systems, Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach., On updating the structure of sparse matrix factors, Three‐level BDDC in two dimensions, The factorability of symmetric matrices and some implications for statistical linear models, Differential equations as deterministic models in science and technology Part II: Simulation, A Spatial Model for the Needle Losses of Pine-Trees in the Forests of Baden-Württemberg: An Application of Bayesian Structured Additive Regression, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Matrix partitioning methods for interior point algorithms., Solving linear systems in interior-point methods, Finite element method in the solution of the Euler and Navier‐Stokes equations for internal flow, A FORTRAN program for profile and wavefront reduction, On evaluating elimination tree based parallel sparse cholesky factorizations, On the Convergence Rate of the Cell Discretization Algorithm for Solving Elliptic Problems, A method for calculation of a high-frequency discharge, An Improvement to Exact Reanalysis Algorithm for Local Non-topological Structural Modifications, Performance contest between MLE and GMM for huge spatial autoregressive models, Bandwidth of Bipartite Permutation Graphs in Polynomial Time, An incompleteLU-factorization algorithm based on block bordering, Strategies for Fitting Large, Geostatistical Data in MCMC Simulation, Fast Stokesian dynamics, Iterative methods for linear systems of equations: A brief historical journey, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, A two‐step approach to finite element ordering, Band Generalization of the Golub--Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem, The BPMPD interior point solver for convex quadratic problems, An analysis of the composite step biconjugate gradient method, Solving simultaneous linear equations using recurrent neural networks, Repeated red-black ordering: A new approach, Multiresolution weighted norm equivalencies and applications, Stable, high-order discretization for evolution of the wave equation in $2+1$ dimensions, Algorithm for random close packing of spheres with periodic boundary conditions, Variations on algebraic recursive multilevel solvers (ARMS) for the solution of CFD problems, Bayesian geoadditive seemingly unrelated regression, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Graph perturbations, An optimization modeling for customer redistribution and its spreadsheet implementation, Computer simulation and modeling in railway applications, Weighted graph based ordering techniques for preconditioned conjugate gradient methods, 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, Parallel homotopy algorithm for symmetric large sparse eigenproblems, 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, Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Nonlinear iteration methods for high speed laminar compressible Navier-Stokes equations, On the stability of bedrocks in a neighborhood of two horizontal excavations, Robust linear and nonlinear strategies for solution of the transonic Euler equations, Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction, 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, A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis, Preconditioning complex symmetric linear systems, Hybrid methods for large sparse nonlinear least squares, Parametric investigation of the stability of coaxial cylindrical shells containing flowing fluid, Experimental study of ILU preconditioners for indefinite matrices, Sparse spatial autoregressions, Fitting very large sparse Gaussian graphical models, Parallel solution techniques in computational structural mechanics, Sparse matrix tools for Gaussian models on lattices, A numerical meshless method of soliton-like structures model via an optimal sampling density based kernel interpolation, On large-scale generalized inverses in solving two-by-two block linear systems, Finite element network approximation of conductivity in particle composites, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, Greedy optimal control for elliptic problems and its application to turnpike problems, 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., Estimation of spatial autoregressive models with measurement error for large data sets, Solving systems of elastic bar structures by preconditioned conjugate gradient method, 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, The average parallel complexity of Cholesky factorization, Lower eigenvalue bounds for singular pencils of matrices, An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method, Towards a cost-effective ILU preconditioner with high level fill, A barrier method for dynamic Leontief-type linear programs, Incomplete factorization by local exact factorization (ILUE), 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, Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations, A block version of left-looking AINV preconditioner with one by one or two by two block pivots, A dual gradient-projection method for large-scale strictly convex quadratic problems, A survey on conic relaxations of optimal power flow problem, Irregular wave propagation with a 2DH Boussinesq-type model and an unstructured finite volume scheme, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Symmetric indefinite systems for interior point methods, Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver, 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, A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems, Multisplittings and parallel iterative methods, Diakoptics as a general approach in engineering, Faster tensor train decomposition for sparse data, Comparison of two methods for solving linear equations occurring in molecular dynamics applications, A direct parallel sparse matrix solver, A parallel multi-$p$ method, An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method, Approximating the bandwidth via volume respecting embeddings, Domain decomposition preconditioning in the hierarchical $p$-version of the finite element method, A new efficient algorithm for computing Gröbner bases $(F_4)$, 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, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution, Fast linear equation solvers in high performance electromagnetic field analysis, Separation-of-variables as a preconditioner for an iterative Helmholtz solver, 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, $LU$-decomposition and numerical structure for solving large sparse nonsymmetric linear systems, Preconditioning techniques for large linear systems: A survey, An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations, Two numerical methods for an inverse problem for the 2-D Helmholtz equation, Minimal triangulations of graphs: a survey, Approximation by cubic $C^ 1$-splines on arbitrary triangulations, A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems, Row-ordering schemes for sparse Givens transformations. II. Implicit graph model, Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem, Matrix-equation-based strategies for convection-diffusion equations, Linear algebra on high performance computers, Improving Jacobi and Gauss-Seidel iterations, A sparse sequential quadratic programming algorithm, A two-level ILU preconditioner for electromagnetic applications, 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, Heuristics for matrix bandwidth reduction, Alya: computational solid mechanics for supercomputers, Sparse linear problems and the least squares method, A parallel graph partitioning algorithm for a message-passing multiprocessor, Numerical treatment of wave breaking on unstructured finite volume approximations for extended Boussinesq-type equations, 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, Discontinuous control-volume/finite-element method for advection-diffusion problems, The dynamic behaviour of elastic coaxial cylindrical shells conveying fluid, Solution of sparse positive definite systems on a hypercube, Conditioning analysis of positive definite matrices by approximate factorizations, A parallel multigrid-based preconditioner for the 3D heterogeneous high-frequency Helmholtz equation, PARFES: A method for solving finite element linear equations on multi-core computers, Efficient solution for Galerkin-based polynomial chaos expansion systems, Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems, On sparse matrix orderings in interior point methods, Edge contractions in subclasses of chordal graphs, Cholesky decomposition of a positive semidefinite matrix with known kernel, On symbolic factorization of partitioned sparse symmetric matrices, Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs, Some aspects of parallel implementation of the finite-element method on message passing architectures, Efficient unsteady high Reynolds number flow computations on unstructured grids, Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems, Task scheduling for parallel sparse Cholesky factorization, LU decompositions of generalized diagonally dominant matrices, Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree, Sparse direct factorizations through unassembled hyper-matrices, A locally refined rectangular grid finite element method: Application to computational fluid dynamics and computational physics, Preconditioned biconjugate gradient methods for numerical reservoir simulation, Bandwidth on AT-free graphs, Automated three-dimensional grid refinement on a minicomputer, Stability analysis of cylindrical shells containing a fluid with axial and circumferential velocity components, Dynamics of a large scale rigid-flexible multibody system composed of composite laminated plates, Sparse quasi-Newton updates with positive definite matrix completion, Advances in iterative methods and preconditioners for the Helmholtz equation, On the performance of the algebraic optimized Schwarz methods with applications, Effective preconditioning through minimum degree ordering interleaved with incomplete factorization, Conditioning analysis of sparse block approximate factorizations, On an instance of the inverse shortest paths problem, Continuation methods for approximate large scale object sequencing, The hierarchical basis multigrid method for convection-diffusion equations, On a condensed form for normal matrices under finite sequences of elementary unitary similarities, The decomposition of a communication network considering traffic demand interrelations, A multilevel bilinear programming algorithm for the vertex separator problem, A sparse matrix approach to Bayesian computation in large linear models, Inverse-free recursive multiresolution algorithms for a data approximation problem, A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting, Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming, An $O(N)$ parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice, An Explicit Link between Gaussian Fields and Gaussian Markov Random Fields: The Stochastic Partial Differential Equation Approach, A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields, Hemelb: A high performance parallel lattice-Boltzmann code for large scale fluid flow in complex geometries, How ordinary elimination became Gaussian elimination, A direct active set algorithm for large sparse quadratic programs with simple bounds, Viscous computations using a direct solver, A parallel linear solver exploiting the physical properties of the underlying mechanical problem, An evaluation of low-cost heuristics for matrix bandwidth and profile reductions, Bivariate least squares approximation with linear constraints, $\text{PSPIKE}+$: A family of parallel hybrid sparse linear system solvers, Investigation of the structure of binary variables, Vector processing in simplex and interior methods for linear programming, Simultaneous selection of variables and smoothing parameters in structured additive regression models, Modified block-approximate factorization strategies, Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model, 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, Computational methods in linear algebra, A physical interpretation of factorization and factor modification in structural analysis, Calculs de complexité relatifs à une méthode de dissection emboîtée, Finding pseudoperipheral nodes in graphs, An algorithm to compute a sparse basis of the null space, Feasibility issues in a primal-dual interior-point method for linear programming, Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers, The dual variable method for solving fluid flow difference equations on Delaunay triangulations, 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, The Cholesky factorization in interior point methods, Quotient tree partitioning of undirected graphs, Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, Design and data structure of fully adaptive, multigrid, finite-element software, Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry, Sparsity in higher order methods for unconstrained optimization, Application of the dual active set algorithm to quadratic network optimization, Gaussian process emulators for the stochastic finite element method, A new parallel sparse direct solver: Presentation and numerical experiments in large-scale structural mechanics parallel computing, Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure, Metaheuristic algorithms for the bandwidth reduction of large-scale matrices, On the boundary‐reducing approximate technique for solving finite‐element elliptic problems, Continuous quadratic programming formulations of optimization problems on graphs, Multigrid-based `shifted-Laplacian' preconditioning for the time-harmonic elastic wave equation, A parallel row‐oriented sparse solution method for finite element structural analysis, Estimating spatial covariance using penalised likelihood with weightedL₁penalty, An alternative pseudoperipheral node finder for resequencing schemes, A note on direct methods for approximations of sparse Hessian matrices, Truncated envelope peconditioning technique, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Elastic‐viscoplastic differential equations on a manifold modelling of in‐plane stretching of sheet metal, Class of optimization algorithms for the solution of large nonlinear programming problems. II, Class of optimization algorithms for the solution of large nonlinear programming problems. I, Numerical analysis of a method of transient simulation for gas networks, An efficient analyse phase for element problems, Simulated annealing for profile and fill reduction of sparse matrices, Approximate factorizations with modified S/P consistently ordered M‐factors, S/P images of upper triangular M‐matrices, Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm, Large‐scale computational fluid dynamics by the finite element method, Algorithm for solving the Navier-Stokes equations for the modeling of creeping flows, Unnamed Item, A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C, Karmarkar's projective method for linear programming: a computational survey, A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, Using domain decomposition to solve symmetric, positive‐definite systems on the hypercube computer, Optimal control in first-order Sobolev spaces with inequality constraints, Efficient estimation of eigenvalue counts in an interval, Combination of finite element and integral transform techniques in a heat conduction quasi-static problem, A parallel multithreaded sparse triangular linear system solver, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, A segregated CFD approach to pipe network analysis, Computing a Sparse Basis for the Null Space, The versatility of automatic mesh generators based on tree structures and advanced geometric constructs, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, The Null Space Problem II. Algorithms, \textit{Semtex}: a spectral element-Fourier solver for the incompressible Navier-Stokes equations in cylindrical or Cartesian coordinates, Stability of Rotating Coaxial Cylindrical Shells Interacting with a Flowing and Rotating Fluid, A PDE-based inverse solver for diffusion tomography using multiple continuous wave sources, Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées, Finite Element Methods for Nonlinearly Viscous Fluids, Direct Finite Element Computation of Periodic Adsorption Processes, On the solution of determinantal systems of linear inequalities, Subset feedback vertex sets in chordal graphs, Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications, Finite Element Methods for Nonlinearly Viscous Fluids, Finite Element Methods for Nonlinearly Viscous Fluids, State-of-the-Art Sparse Direct Solvers, The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures, Fast cars, Kriging with large data sets using sparse matrix techniques, Sparse matrices, and the estimation of variance components by likelihood methods, Edge Contractions in Subclasses of Chordal Graphs, A multigrid-based shifted Laplacian preconditioner for a fourth-order Helmholtz discretization, A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems, Some useful strategies for unstructured edge-based solvers on shared memory machines, Detecting fixed patterns in chordal graphs in polynomial time, 3D adaptive mesh refinement, VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems, Implementing cholesky factorization for interior point methods of linear programming, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, Tree decomposition and discrete optimization problems: a survey, Inherited Matrix Entries: Principal Submatrices of the Inverse, Raffinement de la borne spectrale d'un faisceau de matrices, A Multigrid Method Based on Incomplete Gaussian Elimination, Generalized structured additive regression based on Bayesian P-splines, Non-life rate-making with Bayesian GAMs, Splitting dense columns of constraint matrix in interior point methods for large scale linear programming¹¹The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:²²A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…, Applications of statistical condition estimation to the solution of linear systems, On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions, An evaluation of limited-memory sparse linear solvers for thermo-mechanical applications, New shape functions for triangular $p$-FEM using integrated Jacobi polynomials, Sparse matrix factor modification in structural reanalysis, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, Scattered data interpolation based upon generalized minimum norm networks, A linear time implementation of the reverse Cuthill-McKee algorithm, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, Minimum fill-in: inapproximability and almost tight lower bounds, Solving quadratically constrained convex optimization problems with an interior-point method, On some properties of the Laplacian matrix revealed by the RCM algorithm, Efficient Mesh Management in Firedrake Using PETSc DMPlex, Complex Network Partitioning Using Label Propagation, A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Unnamed Item, A note on factoring 0-1 matrices, The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study, Unnamed Item, Modifying a graph using vertex elimination, Yale sparse matrix package I: The symmetric codes, A radial basis function (RBF)-finite difference (FD) method for diffusion and reaction-diffusion equations on surfaces, Performance of Jacobi preconditioning in Krylov subspace solution of finite element equations

Uses Software