Definition:Ritz Method
Jump to navigation
Jump to search
![]() | This article needs to be linked to other articles. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{MissingLinks}} from the code. |
Definition
Let $\MM$ be a normed linear space.
Let $J\sqbrk y$ be a functional defined on space $\MM$.
Let $\sequence{\phi_n}$ be an infinite sequence of mappings in $\MM$.
Let $\MM_n$ be an $n$-dimensional linear subspace of $\MM$, spanned by first $n$ mapping of $\sequence{\phi_n}$.
Let $\eta_n = \boldsymbol \alpha \boldsymbol \phi$, where $\boldsymbol \alpha$ is a real $n$-dimensional vector.
Minimise $J \sqbrk {\eta_n}$ with respect to $\boldsymbol\alpha$.
Then $J \sqbrk {\eta_n}$ is an approximate minimum of $J \sqbrk y$, and is denoted by $\mu_n$.
This method is known as Ritz method.
Also see
Source of Name
This entry was named for Walther Ritz.
Sources
- 1963: I.M. Gelfand and S.V. Fomin: Calculus of Variations ... (previous) ... (next): $\S 8.40 $: The Ritz Method and the Method of Finite Differences