• Keine Ergebnisse gefunden

Operator-Splitting Methods Respecting Eigenvalue Problems For Shallow Shelf Equations With Basal Drag

N/A
N/A
Protected

Academic year: 2022

Aktie "Operator-Splitting Methods Respecting Eigenvalue Problems For Shallow Shelf Equations With Basal Drag"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Operator-Splitting Methods Respecting Eigen- value Problems for Shallow Shelf Equations with Basal Drag

J¨urgen Geiser1∗and Reinhard Calov2

1 Department of Physics, Ernst-Moritz-Arndt University of Greifswald, Felix- Hausdorff-Str. 6, D-17489 Greifswald, Germany, 2 Potsdam Institute for Cli- mate Impact Research, PO Box 60 12 03, D-14412 Potsdam, Germany

The paper is published in the following journal as:

J. Geiser and R. Calov, Operator-Splitting Methods Respecting Eigenvalue Problems for Shallow Shelf Equations with Basal Drag. Coupled Systems Mechanics, Techno-Press, Yuseong-gu Daejeon, Korea, 1(4): 325-343, 2012.

technopress.kaist.ac.kr/?page=containerjournal=csmvolume=1num=4

Corresponding author. Email addresses: geiser@mathematik.hu-berlin.de (J. Geiser), calov@pik-potsdam.de(R. Calov)

http://www.global-sci.com/ Global Science Preprint

Referenzen

ÄHNLICHE DOKUMENTE

We generalize the Guyan condensation of large symmetric eigenvalue problems to allow general degrees of freedom to be master variables.. On one hand useful in- formation from

If we decompose into 12 identical substructures each being a square with side length 0:5, and if we choose the masters and slaves as the boundary and interior grid points of

For sparse linear eigenvalue problems Ax = λx, iterative projection methods like the Lanczos, Arnoldi, rational Krylov or Jacobi–Davidson method are well established.. The basic idea

In [47], [48], [50] Ruhe generalized the rational Krylov approach for linear eigen- problems [49] to sparse nonlinear eigenvalue problems by nesting the linearization of problem (1)

For linear sparse eigenproblems T (λ) = λB − A very efficient methods are itera- tive projection methods (Lanczos method, Arnoldi method, Jacobi–Davidson method, e.g.),

Table 7 shows the solve time, the mean projection time, the number of iterations, the number of cliques after merging, and the maximum clique size of the sparsity pattern for

cation method: denoting by ipj the characteristic function of (tj,t.. Let the conditions of Theorem 2 be fulfilled. An analogous result for the multidimensional case Is

The main accomplishment of this paper is the development and analysis of an adaptive numerical scheme which for a wide class of operator equations (including those of negative order)