We introduce and analyze a lower envelope method (LEM) for the tracking of interfaces motion in multiphase problems. The main idea of the method is to define the phases as the regions where the lower envelope of a set of functions coincides with exactly one of the functions. We show that a variety of complex lower-dimensional interfaces naturally appear in the process. The phases evolution is then achieved by solving a set of transport equations. In the first part of the paper, we show several theoretical properties, give conditions to obtain a well-posed behaviour, and show that the level set method is a particular case of the LEM. In the second part, we propose a LEM-based numerical algorithm for multiphase shape optimization problems. We apply this algorithm to an inverse conductivity problem with three phases and present several numerical results.
相關內容
Experimental aeroacoustics is concerned with the estimation of acoustic source power distributions, which are for instance caused by fluid structure interactions on scaled aircraft models inside a wind tunnel, from microphone array measurements of associated sound pressure fluctuations. In the frequency domain aeroacoustic sound propagation can be modelled as a random source problem for a convected Helmholtz equation. This article is concerned with the inverse random source problem to recover the support of an uncorrelated aeroacoustic source from correlations of observed pressure signals. We show a variant of the factorization method from inverse scattering theory can be used for this purpose. We also discuss a surprising relation between the factorization method and a commonly used beamforming algorithm from experimental aeroacoustics, which is known as Capon's method or as the minimum variance method. Numerical examples illustrate our theoretical findings.
In this paper, we propose Nesterov Accelerated Shuffling Gradient (NASG), a new algorithm for the convex finite-sum minimization problems. Our method integrates the traditional Nesterov's acceleration momentum with different shuffling sampling schemes. We show that our algorithm has an improved rate of $\mathcal{O}(1/T)$ using unified shuffling schemes, where $T$ is the number of epochs. This rate is better than that of any other shuffling gradient methods in convex regime. Our convergence analysis does not require an assumption on bounded domain or a bounded gradient condition. For randomized shuffling schemes, we improve the convergence bound further. When employing some initial condition, we show that our method converges faster near the small neighborhood of the solution. Numerical simulations demonstrate the efficiency of our algorithm.
We consider an elliptic linear-quadratic parameter estimation problem with a finite number of parameters. A novel a priori bound for the parameter error is proved and, based on this bound, an adaptive finite element method driven by an a posteriori error estimator is presented. Unlike prior results in the literature, our estimator, which is composed of standard energy error residual estimators for the state equation and suitable co-state problems, reflects the faster convergence of the parameter error compared to the (co)-state variables. We show optimal convergence rates of our method; in particular and unlike prior works, we prove that the estimator decreases with a rate that is the sum of the best approximation rates of the state and co-state variables. Experiments confirm that our method matches the convergence rate of the parameter error.
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and $\{0,1\}$-matrices over the rationals. The sufficient condition is generally necessary as well.
In this paper, we characterize data-time tradeoffs of the proximal-gradient homotopy method used for solving linear inverse problems under sub-Gaussian measurements. Our results are sharp up to an absolute constant factor. We demonstrate that, in the absence of the strong convexity assumption, the proximal-gradient homotopy update can achieve a linear rate of convergence when the number of measurements is sufficiently large. Numerical simulations are provided to verify our theoretical results.
In this paper we are concerned with Trefftz discretizations of the time-dependent linear wave equation in anisotropic media in arbitrary space dimensional domains $\Omega \subset \mathbb{R}^d~ (d\in \mathbb{N})$. We propose two variants of the Trefftz DG method, define novel plane wave basis functions based on rigorous choices of scaling transformations and coordinate transformations, and prove that the corresponding approximate solutions possess optimal-order error estimates with respect to the meshwidth $h$ and the condition number of the coefficient matrices, respectively. Besides, we propose the global Trefftz DG method combined with local DG methods to solve the time-dependent linear nonhomogeneous wave equation in anisotropic media. In particular, the error analysis holds for the (nonhomogeneous) Dirichlet, Neumann, and mixed boundary conditions from the original PDEs. Furthermore, a strategy to discretize the model in heterogeneous media is proposed. The numerical results verify the validity of the theoretical results, and show that the resulting approximate solutions possess high accuracy.
In this article, we have considered a nonlinear nonlocal time dependent fourth order equation demonstrating the deformation of a thin and narrow rectangular plate. We propose $C^1$ conforming virtual element method (VEM) of arbitrary order, $k\ge2$, to approximate the model problem numerically. We employ VEM to discretize the space variable and fully implicit scheme for temporal variable. Well-posedness of the fully discrete scheme is proved under certain conditions on the physical parameters, and we derive optimal order of convergence in both space and time variable. Finally, numerical experiments are presented to illustrate the behaviour of the proposed numerical scheme.
Minimax problems have gained tremendous attentions across the optimization and machine learning community recently. In this paper, we introduce a new quasi-Newton method for minimax problems, which we call $J$-symmetric quasi-Newton method. The method is obtained by exploiting the $J$-symmetric structure of the second-order derivative of the objective function in minimax problem. We show that the Hessian estimation (as well as its inverse) can be updated by a rank-2 operation, and it turns out that the update rule is a natural generalization of the classic Powell symmetric Broyden (PSB) method from minimization problems to minimax problems. In theory, we show that our proposed quasi-Newton algorithm enjoys local Q-superlinear convergence to a desirable solution under standard regularity conditions. Furthermore, we introduce a trust-region variant of the algorithm that enjoys global R-superlinear convergence. Finally, we present numerical experiments that verify our theory and show the effectiveness of our proposed algorithms compared to Broyden's method and the extragradient method on three classes of minimax problems.
We are entering our tenth year of the current Artificial Intelligence (AI) spring, and, as with previous AI hype cycles, the threat of an AI winter looms. AI winters occurred because of ineffective approaches towards navigating the technology valley of death. The 6-D framework provides an end-to-end framework to successfully navigate this challenge. The 6-D framework starts with problem decomposition to identify potential AI solutions, and ends with considerations for deployment of AI-enabled systems. Each component of the 6-D framework and a precision medicine use case is described in this paper.
In this paper, a theoretical scheme is proposed for shape-programming of thin hyperelastic plates through differential growth. First, starting from the 3D governing system of a hyperelastic (neo-Hookean) plate, a consistent finite-strain plate equation system is formulated through a series-expansion and truncation approach. Based on the plate equation system, the problem of shape-programming is studied under the stress-free assumption. By equating the stress components in the plate equations to be zero, the explicit relations between growth functions and geometrical quantities of the target shape of the plate are derived. Then, a theoretical scheme of shape-programming is proposed, which can be used to identify the growth fields corresponding to arbitrary 3D shapes of the plate. To demonstrate the efficiency of the scheme, some typical examples are studied. The predicted growth functions in these examples are adopted in the numerical simulations, from which the target shapes of the plate can be recovered completely. The scheme of shape-programming proposed in the current work is applicable for manufacture of intelligent soft devices.
小貼士
登錄享
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191