Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
From MaRDI portal
Publication:3694541
DOI10.1137/0905038zbMath0575.65031OpenAlexW2061702008MaRDI QIDQ3694541
Michael T. Heath, Robert J. Plemmons, Robert C. Ward
Publication date: 1984
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0905038
structural optimizationorthogonal factorizationGivens rotationsforce methodconstrained sum-of- squares methodsparse least squaresturnback-QR method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)
Related Items
Algorithms and experiments for structural mechanics on high-performance architectures, An efficient graph‐theoretical force method for three‐dimensional finite element analysis, The construction of a null basis for a discrete divergence operator, Separators and structure prediction in sparse orthogonal factorization, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, A constrained least-squares approach to the rapid reanalysis of structures, Sparse null basis computations in structural optimization, A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis, Computing a Sparse Basis for the Null Space, An efficient algorithm for sparse null space basis problem using ABS methods, Block computation and representation of a sparse nullspace basis of a rectangular matrix, Generalized QR factorization and its applications, Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements, Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations, Null-Space Preconditioners for Saddle Point Systems, Efficient graph-theoretical force method for two-dimensional rectangular finite element analysis, Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons, An algorithm to compute a sparse basis of the null space, Iterative solution of Navier-Stokes dual variable difference equations, Convergence of a direct-iterative method for large-scale least-squares problems, Order-reducing conjugate gradients versus block AOR for constrained least-squares problems, SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS, A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
Uses Software
