#### Filter Results:

#### Publication Year

2008

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- David E. Keyes, Lois C. McInnes, Carol S. Woodward, William Gropp, Eric Myra, Michael Pernice +39 others
- IJHPCA
- 2013

In this talk I will overview a survey paper developed from the DOE-‐sponsored Institute for Computing in Science Workshop on " Multiphysics Simulations: Challenges and Opportunities. " In this paper, we considered multiphysics applications from algorithmic and architectural perspectives where " architectural " included both software and hardware… (More)

There have been many numerical simulations but few analytical results of stability and accuracy of algorithms for computational modeling of fluid-fluid and fluid-structure interaction problems, where two domains corresponding to different fluids (ocean-atmosphere) or a fluid and deformable solid (blood flow) are separated by an interface. As a simplified… (More)

A model of two incompressible, Newtonian fluids coupled across a common interface is studied. The nonlinearity of the coupling condition exacerbates the problem of decoupling the fluid calculations in each subdomain, a natural parallelization strategy employed in current climate models. A specialized partitioned time stepping method is studied which… (More)

Two numerical algorithms are presented that couple a Boussinesq model of natural heat convection in two domains, motivated by the dynamic core of climate models. The first uses a monolithic coupling across the fluid–fluid interface. The second is a parallel implementation decoupled via a partitioned time stepping scheme with two-way communication. These new… (More)

A numerical approach to estimating solutions to coupled systems of equations is partitioned time stepping methods, an alternative to monolithic solution methods, recently studied in the context of fluid-fluid and fluid-structure interaction problems. Few analytical results of stability and convergence are available, and typically such methods have been… (More)

Lanczos bidiagonal reduction generates a factorization of a matrix X ∈ R m×n , m ≥ n, such that X = U BV T where U ∈ R m×n is left orthogonal, V ∈ R n×n is orthogonal, and B ∈ R n×n is bidiagonal. Since, in the Lanczos recurrance, the columns of U and V tend to lose orthogonality, a reorthogonalization strategy is necessary to preserve convergence of the… (More)

- ‹
- 1
- ›