symrcm

swMATH8566MaRDI QIDQ20575FDOQ20575

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• An efficient simplex type algorithm for sparse and dense linear programs.
• A survey of direct methods for sparse linear systems
• Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree
• On sparse matrix orderings in interior point methods
• Bandwidth on AT-free graphs
• Title not available (Why is that?)
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• Numerical linear algebra algorithms and software
• On the ordering of sparse linear systems
• Refining an approximate inverse
• Bandwidth of bipartite permutation graphs in polynomial time
• The hierarchical basis multigrid method for convection-diffusion equations
• SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
• Equivalence between lowest-order mixed finite element and multi-point finite volume methods on simplicial meshes
• Iterative methods for overflow queueing models. I
• Factoring matrices with a tree-structured sparsity pattern
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Heuristics for matrix bandwidth reduction
• Fast linear equation solvers in high performance electromagnetic field analysis
• Symbiosis between linear algebra and optimization
• Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs
• Linear and non‐linear iterative methods for the incompressible Navier‐Stokes equations
• Numerical homogenization: survey, new results, and perspectives
• An algorithm for solving singular perturbation problems with mechanization
• Using domain decomposition to find graph bisectors
• A sparse matrix approach to Bayesian computation in large linear models
• Efficient unsteady high Reynolds number flow computations on unstructured grids
• On the performance of the algebraic optimized Schwarz methods with applications
• Viscous computations using a direct solver
• Scattered data interpolation based upon generalized minimum norm networks
• Symmetric indefinite systems for interior point methods
• A practical algorithm for making filled graphs minimal
• Parallel solution techniques in computational structural mechanics
• Improving Jacobi and Gauss-Seidel iterations
• Applications of statistical condition estimation to the solution of linear systems
• Multisplittings and parallel iterative methods
• Convergence of a direct-iterative method for large-scale least-squares problems
• Derivative generation from multivariate scattered data by functional minimization
• A direct method for sparse least squares problems with lower and upper bounds
• A chordal preconditioner for large-scale optimization
• Algorithms of parallel computations for linear algebra problems with irregularly structured matrices
• Continuous quadratic programming formulations of optimization problems on graphs
• Efficient solution for Galerkin-based polynomial chaos expansion systems
• Nonlinear iteration methods for high speed laminar compressible Navier-Stokes equations
• Inherited Matrix Entries: Principal Submatrices of the Inverse
• Conditioning analysis of separate displacement preconditioners for some nonlinear elasticity systems.
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• Multiresolution weighted norm equivalencies and applications
• Sparse direct methods for model simulation
• Robust linear and nonlinear strategies for solution of the transonic Euler equations
• New convergence results and preconditioning strategies for the conjugate gradient method
• Cholesky decomposition of a positive semidefinite matrix with known kernel
• A parallel multigrid-based preconditioner for the 3D heterogeneous high-frequency Helmholtz equation
• Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
• A spectral algorithm for envelope reduction of sparse matrices
• Three‐level BDDC in two dimensions
• Domain decomposition preconditioning in the hierarchical \(p\)-version of the finite element method
• Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• On the use of inexact subdomain solvers for BDDC algorithms
• How ordinary elimination became Gaussian elimination
• A graph-theoretic model of symmetric Givens operations and its implications
• Kriging with large data sets using sparse matrix techniques
• Sparse direct factorizations through unassembled hyper-matrices
• Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
• Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations
• Matrix shapes invariant under the symmetric QR algorithm
• Sparse quasi-Newton updates with positive definite matrix completion
• Bayesian geoadditive seemingly unrelated regression
• A parallel projection method for overdetermined nonlinear systems of equations
• The dual variable method for solving fluid flow difference equations on Delaunay triangulations
• High performance verified computing using C-XSC
• Continuation methods for approximate large scale object sequencing
• A FORTRAN program for profile and wavefront reduction
• Inverse-free recursive multiresolution algorithms for a data approximation problem
• Estimating spatial covariance using penalised likelihood with weightedL₁penalty
• A two‐step approach to finite element ordering
• The decomposition of a communication network considering traffic demand interrelations
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
• A dynamic finite element preanalyser
• An \(O(N)\) parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice
• Finite Element Methods for Nonlinearly Viscous Fluids
• Sparse matrix element topology with application to AMG(e) and preconditioning
• Stress-based finite element analysis of plane plasticity problems
• Efficient mesh management in firedrake using PETSc DMPlex
• Stable, high-order discretization for evolution of the wave equation in \(2+1\) dimensions
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• 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
• Superconsistent collocation methods with applications to convection-dominated convection-diffusion equations
• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• Preconditioned biconjugate gradient methods for numerical reservoir simulation
• A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
• Preconditioning of the \(p\)-version of the finite element method
• The preconditioned conjugate gradient method with incomplete factorization preconditioners
• LU decompositions of generalized diagonally dominant matrices
• The versatility of automatic mesh generators based on tree structures and advanced geometric constructs
• An improvement to exact reanalysis algorithm for local non-topological structural modifications
• Application of the dual active set algorithm to quadratic network optimization
• Investigation of the structure of binary variables

This page was built for software: symrcm