Related papers: An iterative generalized Golub-Kahan algorithm for…
This paper introduces an auto-stabilized weak Galerkin (WG) finite element method for biharmonic equations with built-in stabilizers. Unlike existing stabilizer-free WG methods limited to convex elements in finite element partitions, our…
A conforming discontinuous Galerkin finite element method is introduced for solving the biharmonic equation. This method, by its name, uses discontinuous approximations and keeps simple formulation of the conforming finite element method at…
Motivated by robust matrix recovery problems such as Robust Principal Component Analysis, we consider a general optimization problem of minimizing a smooth and strongly convex loss function applied to the sum of two blocks of variables,…
Permutations and matchings are core building blocks in a variety of latent variable models, as they allow us to align, canonicalize, and sort data. Learning in such models is difficult, however, because exact marginalization over these…
The generalized additive Runge-Kutta (GARK) framework provides a powerful approach for solving additively partitioned ordinary differential equations. This work combines the ideas of symplectic GARK schemes and multirate GARK schemes to…
The two-scale computational homogenization method is proposed for modelling of locally periodic fluid-saturated media subjected a to large deformation induced by quasistatic loading. The periodic heterogeneities are relevant to the…
In this article we develop a convergence theory for goal-oriented adaptive finite element algorithms designed for a class of second-order semilinear elliptic equations. We briefly discuss the target problem class, and introduce several…
Iterative hybrid projection methods have proven to be very effective for solving large linear inverse problems due to their inherent regularizing properties as well as the added flexibility to select regularization parameters adaptively. In…
We revisit the classic stability problem of the buckling of an inextensible, axially compressed beam on a nonlinear elastic foundation with a semi-analytical approach to understand how spatially localized deformation solutions emerge in…
Thanks to modern manufacturing technologies, heterogeneous materials with complex inner structures (e.g., foams) can be easily produced. However, their utilization is not straightforward, as the classical constitutive laws are not…
A wide variety of different (fixed-point) iterative methods for the solution of nonlinear equations exists. In this work we will revisit a unified iteration scheme in Hilbert spaces from our previous work that covers some prominent…
The hybrid LSMR algorithm is proposed for large-scale general-form regularization. It is based on a Krylov subspace projection method where the matrix $A$ is first projected onto a subspace, typically a Krylov subspace, which is implemented…
Due to the lack of corresponding analysis on appropriate mapping operator between two grids, high-order two-grid difference algorithms are rarely studied. In this paper, we firstly discuss the boundedness of a local bi-cubic Lagrange…
This manuscript develops a new framework to analyze and design iterative optimization algorithms built on the notion of Integral Quadratic Constraints (IQC) from robust control theory. IQCs provide sufficient conditions for the stability of…
We consider the iterative solution of regularized saddle-point systems. When the leading block is symmetric and positive semi-definite on an appropriate subspace, Dollar, Gould, Schilders, and Wathen (2006) describe how to apply the…
The rigorous convergence analysis of adaptive finite element methods for regularized variational models of quasi-static brittle fracture in strain-limiting elastic solids is presented. This work introduces two novel adaptive mesh refinement…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…
We propose, analyze, and numerically validate a correction adaptive two-grid finite element method (CAT-GFEM) for nonselfadjoint or indefinite elliptic problems. In contrast to the adaptive two-grid finite element method (ATGFEM) of Li and…
Classical mechanical systems with internal constraints will be examined using the extended symplectic formalism of Faddeev-Jackiw. We will derive the generalized brackets of the theory and the corresponding equations of motion. The…