Richard S. Falk
Rutgers University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Richard S. Falk.
Acta Numerica | 2006
Douglas N. Arnold; Richard S. Falk; Ragnar Winther
Finite element exterior calculus is an approach to the design and understanding of finite element discretizations for a wide variety of systems of partial differential equations. This approach brings to bear tools from differential geometry, algebraic topology, and homological algebra to develop discretizations which are compatible with the geometric, topological, and algebraic structures which underlie well-posedness of the PDE problem being solved. In the finite element exterior calculus, many finite element spaces are revealed as spaces of piecewise polynomial differential forms. These connect to each other in discrete subcomplexes of elliptic differential complexes, and are also related to the continuous elliptic complex through projections which commute with the complex differential. Applications are made to the finite element discretization of a variety of problems, including the Hodge Laplacian, Maxwell’s equations, the equations of elasticity, and elliptic eigenvalue problems, and also to preconditioners.
Bulletin of the American Mathematical Society | 2010
Douglas N. Arnold; Richard S. Falk; Ragnar Winther
This article reports on the confluence of two streams of research, one emanating from the fields of numerical analysis and scientific computation, the other from topology and geometry. In it we consider the numerical discretization of partial differential equations that are related to differential complexes so that de Rham cohomology and Hodge theory are key tools for the continuous problem. After a brief introduction to finite element methods, the discretization methods we consider, we develop an abstract Hilbert space framework for analyzing stability and convergence. In this framework, the differential complex is represented by a complex of Hilbert spaces and stability is obtained by transferring Hodge theoretic structures from the continuous level to the discrete. We show stable discretization is achieved if the finite element spaces satisfy two hypotheses: they form a subcomplex and there exists a bounded cochain projection from the full complex to the subcomplex. Next, we consider the most canonical example of the abstract theory, in which the Hilbert complex is the de Rham complex of a domain in Euclidean space. We use the Koszul complex to construct two families of finite element differential forms, show that these can be arranged in subcomplexes of the de Rham complex in numerous ways, and for each construct a bounded cochain projection. The abstract theory therefore applies to give the stability and convergence of finite element approximations of the Hodge Laplacian. Other applications are considered as well, especially to the equations of elasticity. Background material is included to make the presentation self-contained for a variety of readers.
Journal of Mathematical Analysis and Applications | 1973
Richard S. Falk
Abstract An approximation scheme for a class of optimal control problems is presented. An order of convergence estimate is then developed for the error in the approximation of both the optimal control and the solution of the control equation.
Numerische Mathematik | 2000
Douglas N. Arnold; Richard S. Falk; Ragnar Winther
Summary. We consider the solution of systems of linear algebraic equations which arise from the finite element discretization of variational problems posed in the Hilbert spaces
SIAM Journal on Numerical Analysis | 1989
Douglas N. Arnold; Richard S. Falk
{\bf H (div)}
Mathematics of Computation | 2002
Douglas N. Arnold; Daniele Boffi; Richard S. Falk
and
SIAM Journal on Numerical Analysis | 2004
Douglas N. Arnold; Daniele Boffi; Richard S. Falk
{\bf H (curl)}
Mathematics of Computation | 2007
Douglas N. Arnold; Richard S. Falk; Ragnar Winther
in three dimensions. We show that if appropriate finite element spaces and appropriate additive or multiplicative Schwarz smoothers are used, then the multigrid V-cycle is an efficient solver and preconditioner for the discrete operator. All results are uniform with respect to the mesh size, the number of mesh levels, and weights on the two terms in the inner products.
Mathematics of Computation | 1997
Douglas N. Arnold; Richard S. Falk; Ragnar Winther
A simple finite element method for the Reissner–Mindlin plate model in the prim-itive variables is presented and analyzed. The method uses nonconforming linear finite elements for the transverse displacement and conforming linear finite elements enriched by bubbles for the rotation, with the computation of the element stiffness matrix modified by the inclusion of a simple elementwise averaging. It is proved that the method converges with optimal order uniformly with respect to thickness.
Mathematics of Computation | 1991
Richard S. Falk
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then transformed to a space of functions on each convex quadrilateral element via a bilinear isomorphism of the square onto the element. It is known that for affine isomorphisms, a necessary and sufficient condition for approximation of order r + 1 in L p and order r in W 1 p is that the given space of functions on the reference element contain all polynomial functions of total degree at most r. In the case of bilinear isomorphisms, it is known that the same estimates hold if the function space contains all polynomial functions of separate degree r. We show, by means of a counterexample, that this latter condition is also necessary. As applications, we demonstrate degradation of the convergence order on quadrilateral meshes as compared to rectangular meshes for serendipity finite elements and for various mixed and nonconforming finite elements.