相关论文: Galerkin Eigenvector Approximations
The conforming finite element Galerkin method is applied to discretise in the spatial direction for a class of strongly nonlinear parabolic problems. Using elliptic projection of the associated linearised stationary problem with Gronwall…
Galerkin and Petrov-Galerkin methods are some of the most successful solution procedures in numerical analysis. Their popularity is mainly due to the optimality properties of their approximate solution. We show that these features carry…
In this paper we establish a best approximation property of fully discrete Galerkin finite element solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty$ norm. The discretization method…
Complementarity problems and variational inequalities arise in a wide variety of areas, including machine learning, planning, game theory, and physical simulation. In all of these areas, to handle large-scale problem instances, we need fast…
The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces…
In this paper, the discontinuous Petrov--Galerkin approximation of the Laplace eigenvalue problem is discussed. We consider in particular the primal and ultra weak formulations of the problem and prove the convergence together with a priori…
Certain Petrov-Galerkin schemes are inherently stable formulations of variational problems on a given mesh. This stability is primarily obtained by computing an optimal test basis for a given approximation space. Furthermore, these…
In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…
The proximal Galerkin (PG) method is a finite element method for solving variational problems with inequality constraints. It has several advantages, including constraint-preserving approximations and mesh independence. This paper presents…
We consider the Galerkin method for approximating the spectrum of an operator $T+A$ where $T$ is semi-bounded self-adjoint and $A$ satisfies a relative compactness condition. We show that the method is reliable in all regions where it is…
Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…
We introduce a discontinuous Galerkin method for the mixed formulation of the elasticity eigenproblem with reduced symmetry. The analysis of the resulting discrete eigenproblem does not fit in the standard spectral approximation framework…
We study the regularity in weighted Sobolev spaces of Schr\"{o}dinger-type eigenvalue problems, and we analyse their approximation via a discontinuous Galerkin (dG) $hp$ finite element method. In particular, we show that, for a class of…
We introduce in this paper a technique for the reduced order approximation of parametric symmetric elliptic partial differential equations. For any given dimension, we prove the existence of an optimal subspace of at most that dimension…
The aim of this work is to consider multiscale algorithms for solving PDEs with Galerkin methods on bounded domains. We provide results on convergence and condition numbers. We show how to handle PDEs with Dirichlet boundary conditions. We…
In this paper, we present and study $C^1$ Petrov-Galerkin and Gauss collocation methods with arbitrary polynomial degree $k$ ($\ge 3$) for one-dimensional elliptic equations. We prove that, the solution and its derivative approximations…
In recent years two Krylov subspace methods have been proposed for solving skew symmetric linear systems, one based on the minimum residual condition, the other on the Galerkin condition. We give new, algorithm-independent proofs that in…
We consider the numerical approximation of the spectrum of a second-order elliptic eigenvalue problem by the hybridizable discontinuous Galerkin (HDG) method. We show for problems with smooth eigenfunctions that the approximate eigenvalues…
We study two inexact methods for solutions of random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric matrix operator, the methods solve for eigenvalues and…
We consider a linear parabolic problem with random elliptic operator in the usual Gelfand triple setting. We do not assume uniform bounds on the coercivity and boundedness constants, but allow them to be random variables. The parabolic…