Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 69 for “"Schur complement"”.
-
Parallel Schur Complement Algorithms for the Solution of Sparse Linear Systems and Eigenvalue Problems
… the interface problem is usually related to the Schur complement. Both ILU factorization and eigenvalue problems can be accelerated using the DD-based Schur complement approaches. This dissertation focuses on the parallel DD-based Schur complement approach for the solution of large sparse linear …
-
An Efficient Interior-Point Decomposition Algorithm for Parallel Solution of Large-Scale Nonlinear Problems with Significant Variable Coupling
… and parallel solution is possible using a Schur-complement decomposition. Three major variants are implemented: a serial, full-space interior-point method, serial and parallel versions of an explicit Schur-complement decomposition, and serial and parallel versions of an implicit PCG-based …
-
Approximation of Generalized Schur Complements (Ladder Network)
The Schur complement of a linear operator on a finite dimensional Hilbert space is discussed and six generalizations are presented. Conditions are established under which these generalizations are equivalent. The infinite dimensional case is then considered and counterexamples are given to show …
-
A parallel active-set method for solving frictional contact problems
… at each iteration. We introduce a method, SCHURPA, which employs a primal-dual active-set strategy to efficiently solve these QPs based on a Schur-complement method. A single factorization of the initial saddle point system and a smaller dense Schur-complement is maintained to solve …
-
The Matrix Sortability Problem
… corresponds with the more than a century old Schur complement operation on these matrices. In this thesis, we confirm this prior speculation about the correspondence between Mcds and the Schur complement, in the context of GF(2). We generalize the Mcds operation to not necessarily square …
-
A new class of preconditioners for large-scale linear systems from interior-point methods for linear programming
… system. This system can be reduced to the Schur complement system which is positive definite. After the reduction, the solution for the linear system is usually computed via the Cholesky factorization. This factorization can be dense for some classes of problems. Therefore, the solution of …
-
Extensions of Perron-Frobenius Theory
… and GM-matrices focusing on the properties their Schur complements inherit. Specifically, we study sufficient and necessary conditions for the Schur complement of various types of Mv-matrices that have the Mv-property. Also, the Schur complements of perturbed Mv-matrices are studied. Then, we …
-
Domain Decomposition for Coupled Systems of Fluid-Structure Interaction and Numerical Modeling for Thin Film Polymers
… well-posed. To derive the partitioned scheme, a Schur complement equation, which implicitly expresses the Lagrange multiplier and the fluid pressure in terms of the fluid velocity and structural displacement, is constructed based on the monolithic FSI system. Solving the Schur complement system …
-
A Computational Framework for Axisymmetric Linear Elasticity and Parallel Iterative Solvers for Two-Phase Navier–Stokes
… in this work is the development of a new Schur complement approach for preconditioning the two-phase Navier--Stokes equations. Considerable research effort has been invested in the development of Schur complement preconditioning techniques for the Navier--Stokes equations, with the …
-
Fast solvers for heterogeneous saddle point problems arising from phasefield-models
… we develop a symmetric positive definite Schur complement preconditioner, which is based on a spectrally equivalent approximation of the actual Schur complement.
-
Domain decomposition methods for the solution of multiple scattering problems
This presents a Schur complement Domain Decomposition (DD) algorithm for the solution of frequency domain multiple scattering problems. Just as in the classical DD methods,(1) the ensemble of scatterers is enclosed in a domain bounded by an artificial boundary, (2) this domain is subdivided into a …
-
Block Preconditioners for the Navier-Stokes Equations
… based on the approximation of the Schur complement. All these techniques can be represented as approximate block factorization (ABF) type preconditioners. The goal is to decompose the application of the preconditioner into simplified sub-systems in which scalable multi-level type …
-
Hessian Matrix-Free Lagrange-Newton-Krylov-Schur-Schwarz Methods for Elliptic Inverse Problems
… an inner-outer structure, taking the form of a Schur complement (block factorization) at the outer level and Schwarz projections at the inner level. However, building an exact Schur complement is prohibitively expensive. Thus, we use Schur complement approximations, including the identity, …
-
Computation of multiscale time-harmonic electromagnetic radiation
… or high-frequency asymptotic methods through a Schur complement analysis of the continuous and discretized equations. The proposed Schur complement EPA-PO hybrid introduces clear physics with applicability to other formulations for the individual domains. The proposed hybrid also maps the PO …
-
A Modified Preconditioned Conjugate Gradient Method for Approximating the Scattering Amplitude
… positive spectrum. We investigate the use of Schur Complement preconditioners with block-diagonal factorization to speed up the convergence of our method and compare the results to our NspcG method without preconditioning.
-
Convex minimization and phase field models
… of this functional turns out to be the nonlinear Schur complement of the saddle point problem. Generalized linearizations for the Schur complement are derived and used for a nonsmooth Newton method. Global convergence for this 'Schur Nonsmooth Newton' method and inexact versions is proved using …
-
Algorithms and Software for Structured Semidefinite Optimization
… of IP methods is assembling the so-called Schur complement equation and finding a solution for it, in which the matrix becomes increasingly ill-conditioned as the interior-point method makes progress toward the solution. To tackle this challenge, instead of the direct solver (Cholesky …
-
Trace finite element method for material surface flows
… Eigenvalue bounds for the preconditioned Schur complement are derived. Properties of the proposed method are illustrated with numerical examples which include simulation of Kelvin--Helmholtz instability at different Reynolds numbers on a sphere and torus, as well as tangential flow induced …
-
Global convection in Earth's mantle : advanced numerical methods and extreme-scale simulations
… improved nonlinear convergence. We present a new Schur complement-based Stokes preconditioner, weighted BFBT, that exhibits robust fast convergence for Stokes problems with smooth but highly varying (up to 10 orders of magnitude) viscosities, optimal algorithmic scalability with respect to mesh …
-
Linear solvers and coupling methods for compositional reservoir simulators
… the new coupled implementation was based on the Schur complement method. For the partition method, two suitable acceleration techniques were constructed. One technique was the optimized choice of preconditioner for the Schur complement; the other was the optimized selection of tolerances for the …
Page 1 of 4