We investigate the following inverse problem:starting from the acoustic wave equation,reconstruct a piecewise constant passive acoustic source from a single boundary temporal measurement without knowing the speed of s...We investigate the following inverse problem:starting from the acoustic wave equation,reconstruct a piecewise constant passive acoustic source from a single boundary temporal measurement without knowing the speed of sound.When the amplitudes of the source are known a priori,we prove a unique determination result of the shape and propose a level set algorithm to reconstruct the singularities.When the singularities of the source are known a priori,we show unique determination of the source amplitudes and propose a least-squares fitting algorithm to recover the source amplitudes.The analysis bridges the low-frequency source inversion problem and the inverse problem of gravimetry.The proposed algorithms are validated and quantitatively evaluated with numerical experiments in 2D and 3D.展开更多
We propose a fast local level set method for the inverse problem of gravimetry.The theoretical foundation for our approach is based on the following uniqueness result:if an open set D is star-shaped or x3-convex with ...We propose a fast local level set method for the inverse problem of gravimetry.The theoretical foundation for our approach is based on the following uniqueness result:if an open set D is star-shaped or x3-convex with respect to its center of gravity,then its exterior potential uniquely determines the open set D.To achieve this purpose constructively,the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes.To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set.The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domainΩ.To overcome this difficulty,we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain containing the unknown set D.The third challenge is how to speed up the level set inversion process.Based on some features of the underlying inverse gravimetry problem such as the potential density being constant inside the unknown domain,we propose a novel numerical approach which is able to take advantage of these features so that the computational speed is accelerated by an order of magnitude.We carry out numerical experiments for both two-and three-dimensional cases to demonstrate the effectiveness of the new algorithm.展开更多
We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze t...We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze the convergence of the first-order Lax-Friedrichs sweeping scheme by using the theory of nonlinear iteration. In addition, we propose a fifth-order Weighted PowerENO sweeping scheme for static Hamilton-Jacobi equations with convex Hamiltonians and present numerical examples that validate the effectiveness of the new stopping criterion.展开更多
The equilibriummetric forminimizing a continuous congested trafficmodel is the solution of a variational problem involving geodesic distances.The continuous equilibrium metric and its associated variational problem ar...The equilibriummetric forminimizing a continuous congested trafficmodel is the solution of a variational problem involving geodesic distances.The continuous equilibrium metric and its associated variational problem are closely related to the classical discrete Wardrop’s equilibrium.We propose an adjoint state method to numerically approximate continuous traffic congestion equilibria through the continuous formulation.The method formally derives an adjoint state equation to compute the gradient descent direction so as to minimize a nonlinear functional involving the equilibrium metric and the resulting geodesic distances.The geodesic distance needed for the state equation is computed by solving a factored eikonal equation,and the adjoint state equation is solved by a fast sweeping method.Numerical examples demonstrate that the proposed adjoint state method produces desired equilibrium metrics and outperforms the subgradient marching method for computing such equilibrium metrics.展开更多
基金partially supported by the NSF(Grant Nos.2012046,2152011,and 2309534)partially supported by the NSF(Grant Nos.DMS-1715178,DMS-2006881,and DMS-2237534)+1 种基金NIH(Grant No.R03-EB033521)startup fund from Michigan State University.
文摘We investigate the following inverse problem:starting from the acoustic wave equation,reconstruct a piecewise constant passive acoustic source from a single boundary temporal measurement without knowing the speed of sound.When the amplitudes of the source are known a priori,we prove a unique determination result of the shape and propose a level set algorithm to reconstruct the singularities.When the singularities of the source are known a priori,we show unique determination of the source amplitudes and propose a least-squares fitting algorithm to recover the source amplitudes.The analysis bridges the low-frequency source inversion problem and the inverse problem of gravimetry.The proposed algorithms are validated and quantitatively evaluated with numerical experiments in 2D and 3D.
基金supported by an NGA NURI grant.Leung’s research is partially supported by the RGC under Grant DAG09/10.SC02 and GRF602210supported by NSF 0810104.
文摘We propose a fast local level set method for the inverse problem of gravimetry.The theoretical foundation for our approach is based on the following uniqueness result:if an open set D is star-shaped or x3-convex with respect to its center of gravity,then its exterior potential uniquely determines the open set D.To achieve this purpose constructively,the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes.To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set.The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domainΩ.To overcome this difficulty,we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain containing the unknown set D.The third challenge is how to speed up the level set inversion process.Based on some features of the underlying inverse gravimetry problem such as the potential density being constant inside the unknown domain,we propose a novel numerical approach which is able to take advantage of these features so that the computational speed is accelerated by an order of magnitude.We carry out numerical experiments for both two-and three-dimensional cases to demonstrate the effectiveness of the new algorithm.
基金supported by DGICYT MTM2008-03597Ramon y Cajal Programsupported by NSF DMS # 0810104
文摘We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze the convergence of the first-order Lax-Friedrichs sweeping scheme by using the theory of nonlinear iteration. In addition, we propose a fifth-order Weighted PowerENO sweeping scheme for static Hamilton-Jacobi equations with convex Hamiltonians and present numerical examples that validate the effectiveness of the new stopping criterion.
基金supported by NSF 0810104 and NSF 1115363Leung was supported in part by Hong Kong RGC under Grant GRF603011HKUST RPC under Grant RPC11SC06.
文摘The equilibriummetric forminimizing a continuous congested trafficmodel is the solution of a variational problem involving geodesic distances.The continuous equilibrium metric and its associated variational problem are closely related to the classical discrete Wardrop’s equilibrium.We propose an adjoint state method to numerically approximate continuous traffic congestion equilibria through the continuous formulation.The method formally derives an adjoint state equation to compute the gradient descent direction so as to minimize a nonlinear functional involving the equilibrium metric and the resulting geodesic distances.The geodesic distance needed for the state equation is computed by solving a factored eikonal equation,and the adjoint state equation is solved by a fast sweeping method.Numerical examples demonstrate that the proposed adjoint state method produces desired equilibrium metrics and outperforms the subgradient marching method for computing such equilibrium metrics.