Kazufumi Ito

Kazufumi Ito, Bangti Jin, Jun Zou

In this paper, we study the inverse electromagnetic medium scattering problem of estimating the support and shape of medium scatterers from scattered electric or magnetic near-field data. We shall develop a novel direct sampling method based on an analysis of electromagnetic scattering and the behavior of the fundamental solution. The method is applicable even with one incident field and needs only to compute inner products of the measured scattered field with the fundamental solutions located at sampling points. Hence it is strictly direct, computationally very efficient, and highly tolerant to the presence of noise in the data. Two- and three-dimensional numerical experiments indicate that it can provide reliable support estimates of one single and multiple scatterers in case of both exact and highly noisy data.

Yat Tin Chow, Kazufumi Ito, Keji Liu et al.

In this work, we are concerned with the diffusive optical tomography (DOT) problem in the case when only one or two pairs of Cauchy data is available. We propose a simple and efficient direct sampling method (DSM) to locate inhomogeneities inside a homogeneous background and solve the DOT problem in both full and limited aperture cases. This new method is easy to implement and less expensive computationally. Numerical experiments demonstrate its effectiveness and robustness against noise in the data. This provides a new promising numerical strategy for the DOT problem.

Kazufumi Ito, Bangti Jin, Tomoya Takeuchi

We study multi-parameter Tikhonov regularization, i.e., with multiple penalties. Such models are useful when the sought-for solution exhibits several distinct features simultaneously. Two choice rules, i.e., discrepancy principle and balancing principle, are studied for choosing an appropriate (vector-valued) regularization parameter, and some theoretical results are presented. In particular, the consistency of the discrepancy principle as well as convergence rate are established, and an a posteriori error estimate for the balancing principle is established. Also two fixed point algorithms are proposed for computing the regularization parameter by the latter rule. Numerical results for several nonsmooth multi-parameter models are presented, which show clearly their superior performance over their single-parameter counterparts.

Kazufumi Ito, Bangti Jin, Jun Zou

We present a novel numerical method to the time-harmonic inverse medium scattering problem of recovering the refractive index from near-field scattered data. The approach consists of two stages, one pruning step of detecting the scatterer support, and one resolution enhancing step with mixed regularization. The first step is strictly direct and of sampling type, and faithfully detects the scatterer support. The second step is an innovative application of nonsmooth mixed regularization, and it accurately resolves the scatterer sizes as well as intensities. The model is efficiently solved by a semi-smooth Newton-type method. Numerical results for two- and three-dimensional examples indicate that the approach is accurate, computationally efficient, and robust with respect to data noise.

Kazufumi Ito, Bangti Jin

We present a novel approach to nonlinear constrained Tikhonov regularization from the viewpoint of optimization theory. A second-order sufficient optimality condition is suggested as a nonlinearity condition to handle the nonlinearity of the forward operator. The approach is exploited to derive convergence rates results for a priori as well as a posteriori choice rules, e.g., discrepancy principle and balancing principle, for selecting the regularization parameter. The idea is further illustrated on a general class of parameter identification problems, for which (new) source and nonlinearity conditions are derived and the structural property of the nonlinearity term is revealed. A number of examples including identifying distributed parameters in elliptic differential equations are presented.

Cary Humber, Kazufumi Ito, Chad Bouton

This paper formulates a generalized classification algorithm with an application to classifying (or `decoding') neural activity in the brain. Medical doctors and researchers have long been interested in how brain activity correlates to body movement. Experiments have been conducted on patients whom are unable to move, in order to gain insight as to how thinking about movements might generate discernable neural activity. Researchers are tasked with determining which neurons are responsible for different imagined movements and how the firing behavior changes, given neural firing data. For instance, imagined movements may include wrist flexion, elbow extension, or closing the hand. This is just one of many applications to data classification. Though this article deals with an application in neuroscience, the generalized algorithm proposed in this article has applications in scientific areas ranging from neuroscience to acoustic and medical imaging.

Kazufumi Ito, Tomoya Takeuchi

We propose a multi-moment method for one-dimensional hyperbolic equations with smooth coefficient and piecewise constant coefficient. The method is entirely based on the backward characteristic method and uses the solution and its derivative as unknowns and cubic Hermite interpolation for each computational cell. The exact update formula for solution and its derivative is derived and used for an efficient time integration. At points of discontinuity of wave speed we define a piecewise cubic Hermite interpolation based on immersed interface method. The method is extended to the one-dimensional Maxwell's equations with variable material properties.

Kazufumi Ito, Hua Xiang, Jun Zou

We propose an inexact Uzawa algorithm with two variable relaxation parameters for solving the generalized saddle-point system. The saddle-point problems can be found in a wide class of applications, such as the augmented Lagrangian formulation of the constrained minimization, the mixed finite element method, the mortar domain decomposition method and the discretization of elliptic and parabolic interface problems. The two variable parameters can be updated at each iteration, requiring no a priori estimates on the spectrum of two preconditioned subsystems involved. The convergence and convergence rate of the algorithm are analysed. Both symmetric and nonsymmetric saddle-point systems are discussed, and numerical experiments are presented to demonstrate the robustness and effectiveness of the algorithm.

Kazufumi Ito, Tomoya Takeuchi

We develop a numerical scheme for solving time-domain Maxwell's equation. The method is motivated by CIP method which uses function values and its derivatives as unknown variables. The proposed scheme is developed by using the Poisson formula for the wave equation. It is fully explicit space and time integration method with higher order accuracy and CFL number being one. The bi-cubic interpolation is used for the solution profile to attain the resolution. It preserves sharp profiles very accurately without any smearing and distortion due to the exact time integration and high resolution approximation. The stability and numerical accuracy are investigated.

Kazufumi Ito, Yufei Zhang, Jun Zou

We propose some numerical schemes for forward-backward stochastic differential equations (FBSDEs) based on a new fundamental concept of transposition solutions. These schemes exploit time-splitting methods for the variation of constants formula of the associated partial differential equations and a discrete representation of the transition semigroups. The convergence of the schemes is established for FBSDEs with uniformly Lipschitz drivers, locally Lipschitz and maximal monotone drivers. Numerical experiments are presented for several nonlinear financial derivative pricing problems to demonstrate the adaptivity and effectiveness of the new schemes. The ideas here can be applied to construct high-order schemes for FBSDEs with general Markov forward processes.

Cary Humber, Kazufumi Ito

This paper develops and analyzes a generic method for reconstructing solutions to the abstract Cauchy problem in a general Hilbert space, from noisy measured data. The method is based on the relationship between a partial differential equation and its adjoint equation with control. We demonsrate the capability of the method through analysis and numerical experiments.

Kazufumi Ito, Christoph Reisinger, Yufei Zhang

In this work, we propose a class of numerical schemes for solving semilinear Hamilton-Jacobi-Bellman-Isaacs (HJBI) boundary value problems which arise naturally from exit time problems of diffusion processes with controlled drift. We exploit policy iteration to reduce the semilinear problem into a sequence of linear Dirichlet problems, which are subsequently approximated by a multilayer feedforward neural network ansatz. We establish that the numerical solutions converge globally in the $H^2$-norm, and further demonstrate that this convergence is superlinear, by interpreting the algorithm as an inexact Newton iteration for the HJBI equation. Moreover, we construct the optimal feedback controls from the numerical value functions and deduce convergence. The numerical schemes and convergence results are then extended to HJBI boundary value problems corresponding to controlled diffusion processes with oblique boundary reflection. Numerical experiments on the stochastic Zermelo navigation problem are presented to illustrate the theoretical results and to demonstrate the effectiveness of the method.

Simon Arridge, Kazufumi Ito, Bangti Jin et al.

The Poisson model is frequently employed to describe count data, but in a Bayesian context it leads to an analytically intractable posterior probability distribution. In this work, we analyze a variational Gaussian approximation to the posterior distribution arising from the Poisson model with a Gaussian prior. This is achieved by seeking an optimal Gaussian distribution minimizing the Kullback-Leibler divergence from the posterior distribution to the approximation, or equivalently maximizing the lower bound for the model evidence. We derive an explicit expression for the lower bound, and show the existence and uniqueness of the optimal Gaussian approximation. The lower bound functional can be viewed as a variant of classical Tikhonov regularization that penalizes also the covariance. Then we develop an efficient alternating direction maximization algorithm for solving the optimization problem, and analyze its convergence. We discuss strategies for reducing the computational complexity via low rank structure of the forward operator and the sparsity of the covariance. Further, as an application of the lower bound, we discuss hierarchical Bayesian modeling for selecting the hyperparameter in the prior distribution, and propose a monotonically convergent algorithm for determining the hyperparameter. We present extensive numerical experiments to illustrate the Gaussian approximation and the algorithms.

Yat Tin Chow, Kazufumi Ito, Jun Zou

In this work we perform some mathematical analysis on non-negative matrix factorizations (NMF) and apply NMF to some imaging and inverse problems. We will propose a sparse low-rank approximation of big positive data and images in terms of tensor products of positive vectors, and investigate its effectiveness in terms of the number of tensor products to be used in the approximation. A new concept of multi-level analysis (MLA) framework is also suggested to extract major components in the matrix representing structures of different resolutions, but still preserving the positivity of the basis and sparsity of the approximation. We will also propose a semi-smooth Newton method based on primal-dual active sets for the non-negative factorization. Numerical results are given to demonstrate the effectiveness of the proposed method to capture features in images and structures of inverse problems under no a-priori assumption on the data structure, as well as to provide a sparse low-rank representation of the data.

Quyen Huynh, Kazufumi Ito

We develop an efficient algorithm for Synthetic Aperture Sonar imaging based on the one-way wave equations. The algorithm utilizes the operator-splitting method to integrate the one-way wave equations. The well-posedness of the one-way wave equations and the proposed algorithm is shown. A computational result against real field data is reported and the resulting image is enhanced by the BV-like regularization.