Non-linear study of electrohydrodynamic Rayleigh-Taylor instability in a composite fluid-porous layer

The non-linear electrohydrodynamic RTI in presence of electric field bounded above by porous layer and below by a rigid surface, have been studied based on electrohydrodynamic approximations in the effect similar to the Stokes and lubrication approximations. The non-linear problem is studied numerically in the present paper using the Adams-Bashforth predictor and Adams-Moulton corrector numerical techniques. In the conclusion, the non-linear problem discussed here is quite different from that of Babchin et al. (1983) [10] considering the plane Couette flow. The present problem is greatly influenced by the slip velocity at the interface between porous layer and thin film. It is not amenable to analytical treatment as that of Babchin et al. [10]. Therefore, numerical solutions have to be found. Fourth-order accurate central differences are used for spatial discretization using predictor and corrector numerical technique.     

A family of Numerov-type exponentially fitted predictor-corrector methods for the numerical integration of the radial Schrödinger equation

A family of predictor-corrector exponential Numerov-type methods is developed for the numerical integration of the one-dimensional Schrödinger equation. The formula considered contains certain free parameters which allow it to be fitted automatically to exponential functions. The new methods are very simple and integrate more exponential functions than both the well-known fourth-order Numerov-type exponentially fitted methods and the sixth algebraic order Runge-Kutta-type methods. Numerical results also indicate that the new methods are much more accurate than the other exponentially fitted methods mentioned above.     

An infeasible-interior-point predictor-corrector algorithm for theP *-geometric LCP

AP _*-geometric linear complementarity problem (P _*GP) as a generalization of the monotone geometric linear complementarity problem is introduced. In particular, it contains the monotone standard linear complementarity problem and the horizontal linear complementarity problem. Linear and quadratic programming problems can be expressed in a “natural” way (i.e., without any change of variables) asP _*GP. It is shown that the algorithm of Mizunoet al. [6] can be extended to solve theP _*GP. The extended algorithm is globally convergent and its computational complexity depends on the quality of the starting points. The algorithm is quadratically convergent for problems having a strictly complementary solution. The work of F. A. Potra was supported in part by NSF Grant DMS 9305760     

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”. R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion of Science.     

Dynamics and control of few-cycle ultrashort pulse propagation in an asymmetric coupled-quantum-well nanostructure

The nonlinear propagation of few-cycle ultrashort pulse in an asymmetric coupled-quantum-well (CQW) nanostructure is simulated by solving numerically the full Maxwell-Bloch equations with an iterative predictor-corrector finite-difference time-domain method. The behaviors of electric field profiles for 2π and 4π ultrashort pulses in different propagating zones are predicted in details beyond the slowly varying envelope and rotating-wave approximations. This investigation may provide a guideline for optimizing and controlling ultrashort pulses in solid-state media, which are promising for practical applications in high-speed optical communications.     

Twostep-by-twostep continuous PIRKN-type PC methods for nonstiff IVPs

In this paper, we start with the consideration of direct collocation-based Runge-Kutta-Nyström (RKN) methods with continuous output formulas for solving nonstiff initial-value problems (IVPs) for systems of special second-order differential equations y″(t) = f(t, y(t)). At nth step, the continuous output formulas can be used for calculating the step values at (n + 2)th step and the integration processes can be proceeded twostep-by-twostep. In this case, we obtain twostep-by-twostep RKN methods with continuous output formulas (continuous TBTRKN methods). Furthermore, we consider a parallel predictor-corrector (PC) iteration scheme using the continuous TBTRKN methods as corrector methods with predictor methods defined by the continuous output formulas. The resulting twostep-by-twostep parallel-iterated RKN-type PC methods with continuous output formulas (twostep-by-twostep continuous PIRKN-type PC methods or TBTCPIRKN methods) give us a faster integration processes. Numerical comparisons based on the solution of a few widely-used test problems show that the new TBTCPIRKN methods are much more efficient than the well-known PIRKN methods, the famous nonstiff sequential ODEX2, DOP853 codes and comparable with the CPIRKN methods.     

A family of predictor–corrector schemes for a class of variational inequalities

This work is concerned with an abstract problem in the form of a variational inequality, or equivalently a minimization problem involving a non-differential functional. The problem is inspired by a formulation of the initial–boundary value problem of elastoplasticity. The objective of this work is to revisit the predictor–corrector algorithms that are commonly used in computational applications, and to establish conditions under which these are convergent or, at least, under which they lead to decreasing sequences of the functional for the problem. The focus is on the predictor step, given that the corrector step by definition leads to a decrease in the functional. The predictor step may be formulated as a minimization problem. Attention is given to the tangent predictor, a line search approach, the method of steepest descent, and a Newton-like method. These are all shown to lead to decreasing sequences.     

Evaluation of fiber tracking from subsampled q-space data in diffusion spectrum imaging

Diffusion spectrum imaging (DSI) is capable of resolving crossing and touching fiber bundles in a given voxel. Acquisition of DSI data involves sampling large number of points in the q-space which significantly increases scan times. The scan times can be reduced by exploiting the symmetry of the q-space. In this study the fiber pathways for five (fornix, cingulum, superior longitudinal fasciculus, corticospinal tract, and crossing fibers in the centrum semiovale region) fiber bundles derived using three subsampled data sets of different sizes derived from the 257 samples in the q-space are compared. The coefficient of variation of the ratio of the number of fiber pathways for each subsample data set to the original data points, averaged over all the 10 subjects, was used for quantitatively investigating the effect of subsampling on the tractography. The effect of threshold angles on tractography is also investigated. The effect of subsampling on the orientation distribution function (ODF) was quantitatively evaluated using both scalar and vector measures derived from the ODF. A streamline tractography method that improves the curvature problem and reduces the local truncation error to further improve the mapping of fiber pathways is adapted. Analysis of the fiber pathways in ten normal subjects, based on qualitative and quantitative methods, shows that the 129 and 198 q-space points provide very similar result with angle of threshold between 41° and 45°. Based on the scan time advantage, 129 subsampled points appear to be adequate for tractography.     

Third and fourth order iterative methods free from second derivative for nonlinear systems

In this work, we develop a family of predictor-corrector methods free from second derivative for solving systems of nonlinear equations. In general, the obtained methods have order of convergence three but, in some particular cases the order is four. We also perform different numerical tests that confirm the theoretical results and allow us to compare these methods with Newton’s classical method and with other recently published methods.     

一类分数阶常微分方程初值问题的预校算法

利用Caputo导数的性质和二次多项式插值逼近,导出了分数阶二次多项式插值逼近隐式算法的完整计算公式,证明了其整体误差估计为O(hβ),β=min{2+α,3};在此基础上,构造了一类求解分数阶常微分方程初值问题的新的预校算法, 证明了其整体误差估计为 O(hγ),γ=min{2α,2+α,3},并通过数值实例得以验证.