Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximation of exact controls for semi-linear 1D wave equations using a least-squares approach
67
0
0.0
(
0
)
Added by
Arnaud Munch
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The exact distributed controllability of the semilinear wave equation $y_{tt}-y_{xx} + g(y)=f ,1_{omega}$, assuming that $g$ satisfies the growth condition $vert g(s)vert /(vert svert log^{2}(vert svert))rightarrow 0$ as $vert svert rightarrow infty$ and that $g^primein L^infty_{loc}(mathbb{R})$ has been obtained by Zuazua in the nineties. The proof based on a Leray-Schauder fixed point argument makes use of precise estimates of the observability constant for a linearized wave equation. It does not provide however an explicit construction of a null control. Assuming that $g^primein L^infty_{loc}(mathbb{R})$, that $sup_{a,bin mathbb{R},a eq b} vert g^prime(a)-g^{prime}(b)vert/vert a-bvert^r<infty $ for some $rin (0,1]$ and that $g^prime$ satisfies the growth condition $vert g^prime(s)vert/log^{2}(vert svert)rightarrow 0$ as $vert svert rightarrow infty$, we construct an explicit sequence converging strongly to a null control for the solution of the semilinear equation. The method, based on a least-squares approach guarantees the convergence whatever the initial element of the sequence may be. In particular, after a finite number of iterations, the convergence is super linear with rate $1+r$. This general method provides a constructive proof of the exact controllability for the semilinear wave equation.
rate research
Read More
The null distributed controllability of the semilinear heat equation $y_t-Delta y + g(y)=f ,1_{omega}$, assuming that $g$ satisfies the growth condition $g(s)/(vert svert log^{3/2}(1+vert svert))rightarrow 0$ as $vert svert rightarrow infty$ and that $g^primein L^infty_{loc}(mathbb{R})$ has been obtained by Fernandez-Cara and Zuazua in 2000. The proof based on a fixed point argument makes use of precise estimates of the observability constant for a linearized heat equation. It does not provide however an explicit construction of a null control. Assuming that $g^primein W^{s,infty}(mathbb{R})$ for one $sin (0,1]$, we construct an explicit sequence converging strongly to a null control for the solution of the semilinear equation. The method, based on a least-squares approach, generalizes Newton type methods and guarantees the convergence whatever be the initial element of the sequence. In particular, after a finite number of iterations, the convergence is super linear with a rate equal to $1+s$. Numerical experiments in the one dimensional setting support our analysis.
It has been proved by Zuazua in the nineties that the internally controlled semilinear 1D wave equation $partial_{tt}y-partial_{xx}y + g(y)=f 1_{omega}$, with Dirichlet boundary conditions, is exactly controllable in $H^1_0(0,1)cap L^2(0,1)$ with controls $fin L^2((0,1)times(0,T))$, for any $T>0$ and any nonempty open subset $omega$ of $(0,1)$, assuming that $gin mathcal{C}^1(R)$ does not grow faster than $betavert xvert ln^{2}vert xvert$ at infinity for some $beta>0$ small enough. The proof, based on the Leray-Schauder fixed point theorem, is however not constructive. In this article, we design a constructive proof and algorithm for the exact controllability of semilinear 1D wave equations. Assuming that $g^prime$ does not grow faster than $beta ln^{2}vert xvert$ at infinity for some $beta>0$ small enough and that $g^prime$ is uniformly Holder continuous on $R$ with exponent $sin[0,1]$, we design a least-squares algorithm yielding an explicit sequence converging to a controlled solution for the semilinear equation, at least with order $1+s$ after a finite number of iterations.
The exact distributed controllability of the semilinear wave equation $partial_{tt}y-Delta y + g(y)=f ,1_{omega}$ posed over multi-dimensional and bounded domains, assuming that $gin C^1(mathbb{R})$ satisfies the growth condition $limsup_{rto infty} g(r)/(vert rvert ln^{1/2}vert rvert)=0$ has been obtained by Fu, Yong and Zhang in 2007. The proof based on a non constructive Leray-Schauder fixed point theorem makes use of precise estimates of the observability constant for a linearized wave equation. Assuming that $g^prime$ does not grow faster than $beta ln^{1/2}vert rvert$ at infinity for $beta>0$ small enough and that $g^prime$ is uniformly Holder continuous on $mathbb{R}$ with exponent $sin (0,1]$, we design a constructive proof yielding an explicit sequence converging to a controlled solution for the semilinear equation, at least with order $1+s$ after a finite number of iterations.
The epsilon alternating least squares ($epsilon$-ALS) is developed and analyzed for canonical polyadic decomposition (approximation) of a higher-order tensor where one or more of the factor matrices are assumed to be columnwisely orthonormal. It is shown that the algorithm globally converges to a KKT point for all tensors without any assumption. For the original ALS, by further studying the properties of the polar decomposition, we also establish its global convergence under a reality assumption not stronger than those in the literature. These results completely address a question concerning the global convergence raised in [L. Wang, M. T. Chu and B. Yu, emph{SIAM J. Matrix Anal. Appl.}, 36 (2015), pp. 1--19]. In addition, an initialization procedure is proposed, which possesses a provable lower bound when the number of columnwisely orthonormal factors is one. Armed with this initialization procedure, numerical experiments show that the $epsilon$-ALS exhibits a promising performance in terms of efficiency and effectiveness.
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face difficulties when the matrix of constraints contains dense rows or if an algorithmic transformation used in the solution process results in a modified problem that is much denser than the original one. To address this, we propose modifications and new ideas, with an emphasis on requiring the constraints are satisfied with a small residual. We examine combining the null-space method with our recently developed algorithm for computing a null space basis matrix for a ``wide matrix. We further show that a direct elimination approach enhanced by careful pivoting can be effective in transforming the problem to an unconstrained sparse-dense least squares problem that can be solved with existing direct or iterative methods. We also present a number of solution variants that employ an augmented system formulation, which can be attractive when solving a sequence of related problems. Numerical experiments using problems coming from practical applications are used throughout to demonstrate the effectiveness of the different approaches.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
