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 33 for “"Saddle-point problem"”.

  1. Analysis and finite element approximations of parabolic saddle point problems with applications to optimal control

    … some results concerning boundary optimal control problems and related initial-boundary value problems. We prove the existence and uniqueness of the solution of a parabolic saddle point problem, as well as the existence and uniqueness of a penalized and an iterated penalized saddle point problem. …

    iastate Repository record for Analysis and finite element approximations of parabolic saddle point problems with applications to optimal control (opens in a new tab)

  2. Influence of Track-Assembly Geometryon Mobility Over Rigid Terrai

    … question, both of which require the solving of a saddle point problem. Thus for each method two iterative saddle point problem solvers have been compared as well. After choosing a numerical method the mobility of the model is evaluated on rigid obstacles with varying track-assembly geometry. The …

    chalmers Repository record for Influence of Track-Assembly Geometryon Mobility Over Rigid Terrai (opens in a new tab)

  3. A Rate of Convergence for Learning Theory with Consensus

    … poses and solves a distribution free learning problem with consensus that arises in the study of estimation and control strategies for distributed sensor networks. Each node i for i = 1, . . . , n of the sensor network collects independent and identically distributed local measurements {z i} := …

    vt Repository record for A Rate of Convergence for Learning Theory with Consensus (opens in a new tab)

  4. The application of nonlinear programming methods to the solution of constrained saddle-point problems.

    Nonlinear programming methods are used to solve saddle-point problems subject to inequality constraints on the variables; in particular, the type of saddle-point problem arising in pursuit-evasion differential games is considered. The methods investigated fall into two groups: solution of the …

    nps Repository record for The application of nonlinear programming methods to the solution of constrained saddle-point problems. (opens in a new tab)

  5. Efficient Iterative Methods for Saddle Point Problems

    … efficient iterative methods for a type of saddle-point problem, namely the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible fluid flow. These systems are indefinite due to a set of linear constraints on the …

    uiuc Repository record for Efficient Iterative Methods for Saddle Point Problems (opens in a new tab)

  6. Elastic Incompressibility and Large Deformations

    … of three-dimensional, mechanical deformation problems in the context of large deformations. The main focus lies on the prediction of non-linearly elastic, incompressible material. Based on the equilibrium of forces, we present the weak formulation of the large deformation problem. The discrete …

    qucosa-diss

  7. Analysis of the Cell-Vertex Finite Volume Method for Pseudo-Incompressible Divergence Constraints on Quadrilateral and Cuboid Meshes

    … Consequently, we investigate the mixed saddle point problem determined by the pseudo-incompressible divergence constraint and include the source terms responsible for compressible effects. We provide stability and an a-priori error estimate for the projection step in the …

    fu-berlin Repository record for Analysis of the Cell-Vertex Finite Volume Method for Pseudo-Incompressible Divergence Constraints on Quadrilateral and Cuboid Meshes (opens in a new tab)

  8. Convex and quadratic programming

    … the theory of convex and quadratic programming problems and discusses algorithmic procedures used in solving such problems.</p><p>A general overview of mathematical programming is given in Chapter I. It includes formulations of linear, convex, and quadratic problems and a brief history of the …

    ut-knoxville Repository record for Convex and quadratic programming (opens in a new tab)

  9. Fast solvers for heterogeneous saddle point problems arising from phasefield-models

    … construct efficient numerical solvers for linear saddle point problems arising from discretizations of phase-field models. We are particularly interested in systems of Cahn–Hilliard and Penrose–Fife types. The numerical approximation of these models leads to large-scale nonsmooth nonlinear saddle …

    fu-berlin Repository record for Fast solvers for heterogeneous saddle point problems arising from phasefield-models (opens in a new tab)

  10. Stabilised mixed finite element methods on anisotropic meshes

    … meshes. The stability of the discrete saddle-point problem may be affected in a negative way by the anisotropies in the mesh P. The reason is a required compatibility condition (inf-sup condition) between the discrete velocity space V? and the pressure space M?. We identify subspaces G …

    strathclyde Repository record for Stabilised mixed finite element methods on anisotropic meshes (opens in a new tab)

  11. Numerical analysis for harmonic maps between hypersurfaces and grid improvement for computational parametric geometric flows

    … are developed. An unconstrained optimization problem, which has the structure of a nonlinear saddle point problem, is considered. With the help of the surface finite element method local existence and uniqueness results and optimal error estimates for discrete harmonic maps from closed …

    freiburg-diss Repository record for Numerical analysis for harmonic maps between hypersurfaces and grid improvement for computational parametric geometric flows (opens in a new tab)

  12. BDDC algorithms for the PDEs with HDG discretizations

    … (CG) methods are applied to solve the symmetric saddle point problem such as Stokes problem and Brinkman problem with Hybridizable Discontinuous Galerkin (HDG) discretizations. Edge/face average constraints are enforced across the subdomain interface to ensure that the BDDC preconditioned CG …

    ku Repository record for BDDC algorithms for the PDEs with HDG discretizations (opens in a new tab)

  13. Efficient Numerical Treatment of High-contrast Diffusion Problems

    … discretization of the given continuum problem is converted into an equivalent linear system of a saddle point type. Then a robust preconditioner for the Lancsoz method of minimized iterations for solving the derived saddle point problem is proposed. Numerical experiments demonstrate …

    houston Repository record for Efficient Numerical Treatment of High-contrast Diffusion Problems (opens in a new tab)

  14. Iterative Methods for the Elasticity Imaging Inverse Problem

    … a challenging parameter identification inverse problem, that of identifying the Lamé parameter μ in a system of partial differential equations in linear elasticity. Due to the near incompressibility of human tissue, however, common techniques for solving the direct and inverse problems are …

    rit Repository record for Iterative Methods for the Elasticity Imaging Inverse Problem (opens in a new tab)

  15. A splitting algorithm for multistage stochastic programming with application to hydropower scheduling

    … supply and utility deregulation imminent, the problem of long-term scheduling on a hydroelectric power system has become increasingly important.Many of the algorithms developed for this large-scale multistage stochastic problem have relied on the dynamic programming algorithm; and so have …

    washington Repository record for A splitting algorithm for multistage stochastic programming with application to hydropower scheduling (opens in a new tab)

  16. Constraint Preconditioning of Saddle Point Problems

    … solution of linear systems of equations of saddle point form. Saddle point problems are a ubiquitous class of matrices that arise in a host of computational science and engineering applications. The focus here is on improving the convergence of iterative methods for these problems by …

    temple Repository record for Constraint Preconditioning of Saddle Point Problems (opens in a new tab)

  17. Numerical analysis of reproducing kernel collocation method for linear nonlocal models

    … uses a finite number of symmetric quadrature points to evaluate the integral, is proposed. We have shown RK collocation on the quasi-discrete nonlocal diffusion and peridynamic Navier equation converge to their classical counterparts. Finally, for the pure displacement form of the classical …

    texas Repository record for Numerical analysis of reproducing kernel collocation method for linear nonlocal models (opens in a new tab)

  18. BALANCING DOMAIN DECOMPOSITION BY CONSTRAINTS PRECONDITIONERS FOR VIRTUAL ELEMENT DISCRETIZATIONS OF SADDLE-POINT PROBLEMS

    … (BDDC) algorithms to compute the solution of the saddle-point linear systems arising from the VEM discretization of the two and three dimensional incompressible Stokes and Oseen equations. These methods are an evolution of Balancing Neumann Neumann preconditioners where, to obtain scalability in …

    milano Repository record for BALANCING DOMAIN DECOMPOSITION BY CONSTRAINTS PRECONDITIONERS FOR VIRTUAL ELEMENT DISCRETIZATIONS OF SADDLE-POINT PROBLEMS (opens in a new tab)

  19. Numerical Approximation of Shear-Thinning and Johnson-Segalman Viscoelastic Fluid Flows

    … artificially reduced to solve a stable nonlinear problem. The approximation is then improved in the correction step using a linearized correction iteration. Numerical experiments support the theoretical results and demonstrate the effectiveness of the method. Continuation methods with natural and …

    clemson Repository record for Numerical Approximation of Shear-Thinning and Johnson-Segalman Viscoelastic Fluid Flows (opens in a new tab)

  20. Convex minimization and phase field models

    … of a fast iterative solver for nonlinear saddle point problems like the ones that arise from finite element discretization of Cahn-Hilliard equations. The solver relies on a reformulation of the problem as dual minimization problem whose energy functional is differentiable. The gradient of …

    fu-berlin Repository record for Convex minimization and phase field models (opens in a new tab)

Page 1 of 2