Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Carleman-based numerical method for quasilinear elliptic equations with over-determined boundary data and applications
249
0
0.0
(
0
)
Added by
Loc Hoang Nguyen
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility method with a suitable Carleman weight function. The presence of the Carleman weight function allows us to employ a Carleman estimate to prove the convergence of the sequence generated by the iterative scheme above to the desired solution. The convergence of the iteration is fast at an exponential rate without the need of an initial good guess. We apply this method to compute solutions to some general quasilinear elliptic equations and a large class of first-order Hamilton-Jacobi equations. Numerical results are presented.
rate research
Read More
High-precision numerical scheme for nonlinear hyperbolic evolution equations is proposed based on the spectral method. The detail discretization processes are discussed in case of one-dimensional Klein-Gordon equations. In conclusion, a numerical scheme with the order of total calculation cost $O(N log 2N)$ is proposed. As benchmark results, the relation between the numerical precision and the discretization unit size are demonstrated.
This work is devoted to the development and analysis of a linearization algorithm for microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet boundary conditions. This technique plays two roles: to guarantee the unique weak solvability of the microscopic problem and to provide a fine approximation in the macroscopic setting. The scheme systematically relies on the choice of a stabilization parameter in such a way as to guarantee the strong convergence in $H^1$ norm for both the microscopic and macroscopic problems. In the standard variational setting, we prove the $H^1$-type contraction at the micro-scale based on the energy method. Meanwhile, we adopt the classical homogenization result in line with corrector estimate to show the convergence of the scheme at the macro-scale. In the numerical section, we use the standard finite element method to assess the efficiency and convergence of our proposed algorithm.
We propose a controllability method for the numerical solution of time-harmonic Maxwells equations in their first-order formulation. By minimizing a quadratic cost functional, which measures the deviation from periodicity, the controllability method determines iteratively a periodic solution in the time domain. At each conjugate gradient iteration, the gradient of the cost functional is simply computed by running any time-dependent simulation code forward and backward for one period, thus leading to a non-intrusive implementation easily integrated into existing software. Moreover, the proposed algorithm automatically inherits the parallelism, scalability, and low memory footprint of the underlying time-domain solver. Since the time-periodic solution obtained by minimization is not necessarily unique, we apply a cheap post-processing filtering procedure which recovers the time-harmonic solution from any minimizer. Finally, we present a series of numerical examples which show that our algorithm greatly speeds up the convergence towards the desired time-harmonic solution when compared to simply running the time-marching code until the time-harmonic regime is eventually reached.
Fluid flows containing dilute or dense suspensions of thin fibers are widespread in biological and industrial processes. To describe the motion of a thin immersed fiber, or to describe the forces acting on it, it is convenient to work with one-dimensional fiber centerlines and force densities rather than two-dimensional surfaces and surface tractions. Slender body theories offer ways to model and simulate the motion of immersed fibers using only one-dimensional data. However, standard formulations can break down when the fiber surface comes close to intersecting itself or other fibers. In this paper we introduce a numerical method for a recently derived three-dimensional slender body boundary value problem that can be stated entirely in terms of a one-dimensional distribution of forces on the centerline. The method is based on a new completed single-layer potential formulation of fluid velocity which circumvents some of the traditional conditioning issues associated with the unmodified single layer potential. We give numerical results demonstrating the good conditioning and improved performance of the method in the presence of near-intersections.
Nonlinear multi-scale problems are ubiquitous in materials science and biology. Complicated interactions between nonlinearities and (nonseparable) multiple scales pose a major challenge for analysis and simulation. In this paper, we study the numerical homogenization for multi-scale elliptic PDEs with monotone nonlinearity, in particular the Leray-Lions problem (a prototypical example is the p-Laplacian equation), where the nonlinearity cannot be parameterized with low dimensional parameters, and the linearization error is non-negligible. We develop the iterated numerical homogenization scheme by combining numerical homogenization methods for linear equations, and the so-called quasi-norm based iterative approach for monotone nonlinear equation. We propose a residual regularized nonlinear iterative method, and in addition, develop the sparse updating method for the efficient update of coarse spaces. A number of numerical results are presented to complement the analysis and valid the numerical method.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
