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 12 of 12 for “"eigenvalue bounds"”.

  1. Geometric eigenvalue bounds for the Hodge Laplacian and the Steklov problem on differential forms

    … This thesis mainly investigates geometric eigenvalue bounds for the Hodge Laplacian and the associated Steklov problem on differential forms, on compact Riemannian manifolds with boundary.<br/><br/>We establish lower bounds for the smallest positive eigenvalue of the Hodge Laplacian in …

    bristol Repository record for Geometric eigenvalue bounds for the Hodge Laplacian and the Steklov problem on differential forms (opens in a new tab) Download PDF for Geometric eigenvalue bounds for the Hodge Laplacian and the Steklov problem on differential forms (opens in a new tab)

  2. A study of the computation and convergence behavior of eigenvalue bounds for self-adjoint operators

    … of finite element methods for differential eigenvalue problems. An example of a one dimensional Schrodinger operator with a potential is presented which arises in quantum mechanics. Examples using the recent eigenvector-free (EVF) method of Beattie and Goerisch are considered. Since the EVF …

    vt Repository record for A study of the computation and convergence behavior of eigenvalue bounds for self-adjoint operators (opens in a new tab)

  3. Combinatorial Laplacians on Complexes

    … information. This dissertation studies eigenvalue bounds for these operators, extends the construction to finite ∆-sets, and applies the resulting Laplacian to finite semigroups. For simplicial complexes, we obtain higher-dimensional analogues of several upper bounds for the largest …

    iupui Repository record for Combinatorial Laplacians on Complexes (opens in a new tab)

  4. Preconditioners for Generalized Saddle -Point Problems

    … we present results illustrating the eigenvalue bounds on our preconditioners and demonstrating the theoretical justification of these methods. We also present convergence and timing results, showing the effectiveness of our methods in practice. Specifically the use of probing methods …

    uiuc Repository record for Preconditioners for Generalized Saddle -Point Problems (opens in a new tab)

  5. A block preconditioning cost analysis for solving saddle-point linear systems

    … one of two block preconditioners. Algebraic eigenvalue analysis is given for a particular case of the preconditioners. We also give eigenvalue bounds for the preconditioned matrix when the preconditioner is block diagonal and positive definite. We treat linear solves involving the …

    ubc Repository record for A block preconditioning cost analysis for solving saddle-point linear systems (opens in a new tab) Download PDF for A block preconditioning cost analysis for solving saddle-point linear systems (opens in a new tab)

  6. Trace finite element method for material surface flows

    … strategy of the velocity matrix factorization. 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 …

    houston Repository record for Trace finite element method for material surface flows (opens in a new tab)

  7. ADMM for SDP Relaxation of GP

    … problem is well studied and there are many lower bounds such as: the standard eigenvalue bound; projected eigenvalue bounds using both the adjacency matrix and the Laplacian; quadratic programming (QP) bounds derived from imitating the (QP) bounds for the quadratic assignment problem; and …

    waterloo Repository record for ADMM for SDP Relaxation of GP (opens in a new tab)

  8. Fast iterative solvers for PDE-constrained optimization problems

    … motivate and derive our preconditioners, obtain eigenvalue bounds for the preconditioners where relevant, and demonstrate the effectiveness of our strategies through numerical experiments. The goal throughout this work is for our iterative solvers to be feasible and reliable, but also robust with …

    oxford Repository record for Fast iterative solvers for PDE-constrained optimization problems (opens in a new tab)

  9. Fast iterative solvers for PDE-constrained optimization problems

    … motivate and derive our preconditioners, obtain eigenvalue bounds for the preconditioners where relevant, and demonstrate the effectiveness of our strategies through numerical experiments. The goal throughout this work is for our iterative solvers to be feasible and reliable, but also robust with …

    kent Download PDF for Fast iterative solvers for PDE-constrained optimization problems (opens in a new tab)

  10. Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems

    … problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue techniques, convex quadratic programming techniques, and semidefinite programming (SDP). In particular, we show that the SDP relaxation is …

    waterloo Repository record for Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems (opens in a new tab)

  11. Global convection in Earth's mantle : advanced numerical methods and extreme-scale simulations

    … In addition, we derive theoretical eigenvalue bounds to prove spectral equivalence of our inverse Schur complement approximation. Finally, we present a parallel hybrid spectral--geometric--algebraic multigrid (HMG) to approximate the inverses of the Stokes system's viscous block and …

    texas Repository record for Global convection in Earth's mantle : advanced numerical methods and extreme-scale simulations (opens in a new tab)