We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This chapter serves two purposes: it introduces several essential concepts of linear and nonlinear functional analysis that will be used in subsequent chapters and, as an illustration of them, studies the problem of unconstrained minimization of a convex functional. All the necessary notions of existence, uniqueness, and optimality conditions are presented and analyzed. Preconditioned gradient descent methods for strongly convex, locally Lipschitz smooth objectives in infinite dimensions are then presented and analyzed. A general framework to show linear convergence in this setting is then presented. The preconditioned steepest descent with exact and approximate line searches are then analyzed using the same framework. Finally, the application of Newton’s method to the Euler equations is discussed. The local convergence is shown, and how to achieve global convergence is briefly discussed.
Linear Operators and Linear Functionals are studied. Then Operator Spaces, Topological Duals, and Second Duals of Normed Spaces are considered. Lebesgue L(p) Spaces are defined and studied. The theorems of Hahn–Banach Extension, Baire Category, Riesz Representation, Open Mapping, Closed Graph, and Banach Fixed Points are all proven.
This chapter transitions the presentation to Banach spaces equipped with a quadraticnorm defined by a symmetric positive linear operator. Basic terminology and results are established (using a representation of the dual product that is distinct from the one obtained from the Riesz representation associated with such Banach spaces).
This paper introduces a unified operator theory approach to the abstract Plancherel (trace) formulas over homogeneous spaces of compact groups. Let $G$ be a compact group and let $H$ be a closed subgroup of $G$. Let ${G}/{H}\;$ be the left coset space of $H$ in $G$ and let $\mu$ be the normalized $G$-invariant measure on ${G}/{H}\;$ associated with Weil’s formula. Then we present a generalized abstract notion of Plancherel (trace) formula for the Hilbert space ${{L}^{2}}\left( {G}/{H,\,\mu }\; \right)$.
Domain decomposition techniques provide a flexible tool for the numerical
approximation of partial differential equations. Here, we consider
mortar techniques for quadratic finite elements in 3D with
different Lagrange multiplier spaces.
In particular, we
focus on Lagrange multiplier spaces
which yield optimal discretization
schemes and a locally supported basis for the associated
constrained mortar spaces in case
of hexahedral triangulations. As a result,
standard efficient iterative solvers as multigrid methods
can be easily adapted to the nonconforming situation.
We present the discretization errors in different norms for
linear and quadratic mortar finite elements with
different Lagrange multiplier spaces.
Numerical results illustrate the performance of our approach.
Domain decomposition techniques provide a powerful tool for the numerical approximation of partial differential equations.We focus on mortar finite element methods on non-matching triangulations.In particular, we discuss and analyze dual Lagrange multiplier spacesfor lowest order finite elements.These non standard Lagrange multiplier spaces yield optimal discretizationschemes and a locally supported basis for the associatedconstrained mortar spaces. As a consequence,standard efficient iterative solvers as multigrid methods or domain decomposition techniques can be easily adapted to the nonconformingsituation.Here, we introduce new dual Lagrange multiplier spaces. We concentrateon the construction of locally supported and continuous dualbasis functions.The optimality of the associated mortar method is shown. Numerical results illustrate the performance of our approach.
H. O. Kim has shown that contrary to the case of ${{H}^{p}}$-space, the Smirnov class $M$ defined by the radial maximal function is essentially smaller than the classical Smirnov class of the disk. In the paper we show that these two classes have the same corresponding locally convex structure, i.e. they have the same dual spaces and the same Fréchet envelopes. We describe a general form of a continuous linear functional on $M$ and multiplier from $M$ into ${{H}^{p}},\,0\,<\,p\,\le \,\infty $.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.