A scalable Lagrange multiplier based domain decomposition method for time‐dependent problems
- 30 November 1995
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 38 (22) , 3831-3853
- https://doi.org/10.1002/nme.1620382207
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratioInternational Journal for Numerical Methods in Engineering, 1995
- Towards the ultimate iterative substructuring method: Combined numerical and parallel scalability, and multiple load casesComputing Systems in Engineering, 1994
- A transient FETI methodology for large‐scale parallel implicit computations in structural mechanicsInternational Journal for Numerical Methods in Engineering, 1994
- Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanicsInternational Journal for Numerical Methods in Engineering, 1993
- Balancing domain decompositionCommunications in Numerical Methods in Engineering, 1993
- Parallel/vector improvements of the frontal methodInternational Journal for Numerical Methods in Engineering, 1991
- A lagrange multiplier based divide and conquer finite element algorithmComputing Systems in Engineering, 1991
- A new finite element concurrent computer program architectureInternational Journal for Numerical Methods in Engineering, 1987
- Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth IssuesThe International Journal of Supercomputing Applications, 1987
- The construction of preconditioners for elliptic problems by substructuring. IMathematics of Computation, 1986