1.2MATH-PHOct 6, 2014
Direct Sampling Method for Diffusive Optical TomographyYat 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.
4.3NAMar 25, 2011
Multi-Parameter Tikhonov RegularizationKazufumi 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.
2.5OCDec 5, 2010
Nonsmooth Formulation of the Support Vector Machine for a Neural Decoding ProblemCary 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.
1.2NAJun 9, 2011
CIP methods for hyperbolic system with variable and discontinuous coefficientKazufumi 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.
1.2NAAug 24, 2014
An Inexact Uzawa Algorithm for Generalized Saddle-Point Problems and Its ConvergenceKazufumi 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.
1.2NAOct 24, 2011
A multi-moment scheme for the two dimensional Maxwell's equationsKazufumi 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.
1.2NAApr 29, 2018
Fully Discrete Schemes and Their Analyses for Forward-Backward Stochastic Differential EquationsKazufumi 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.
2.5OCFeb 23, 2012
An adjoint control method for initial condition identification of the Abstract Cauchy problemCary 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.
6.6NAJun 5, 2019
A neural network based policy iteration algorithm with global $H^2$-superlinear convergence for stochastic games on domainsKazufumi 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.
3.3OCApr 23, 2015
Analysis on Non-negative Factorizations and ApplicationsYat 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.
1.2NAJul 13, 2009
Synthetic Aperture Sonar Imaging via One-Way Wave EquationsQuyen 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.