Iterative Methods for Solving the Nonlinear Balance Equation with Optimal Truncation

Two types of existing iterative methods for solving the nonlinear balance equation(NBE)are revisited.In the first type,the NBE is rearranged into a linearized equation for a presumably small correction to the initial guess or the subsequent updated solution.In the second type,the NBE is rearranged into a quadratic form of the absolute vorticity with the positive root of this quadratic form used in the form of a Poisson equation to solve NBE iteratively.The two methods are rederived by expanding the solution asymptotically upon a small Rossby number,and a criterion for optimally truncating the asymptotic expansion is proposed to obtain the super-asymptotic approximation of the solution.For each rederived method,two iterative procedures are designed using the integral-form Poisson solver versus the over-relaxation scheme to solve the boundary value problem in each iteration.Upon testing with analytically formulated wavering jet flows on the synoptic,sub-synoptic and meso-αscales,the iterative procedure designed for the first method with the Poisson solver,named M1a,is found to be the most accurate and efficient.For the synoptic wavering jet flow in which the NBE is entirely elliptic,M1a is extremely accurate.For the sub-synoptic wavering jet flow in which the NBE is mostly elliptic,M1a is sufficiently accurate.For the meso-αwavering jet flow in which the NBE is partially hyperbolic so its boundary value problem becomes seriously ill-posed,M1a can effectively reduce the solution error for the cyclonically curved part of the wavering jet flow,but not for the anti-cyclonically curved part.

A HIGH-PERFORMANCE VLSI ARCHITECTURE OF EBCOT BLOCK CODING IN JPEG2000

The paper presents a new architecture composed of bit plane-parallel coder for Embedded Block Coding with Optimized Truncation (EBCOT) entropy encoder used in JPEG2000. In the architecture, the coding information of each bit plane can be obtained simultaneously and processed parallel. Compared with other architectures, it has advantages of high parallelism, and no waste clock cycles for a single point. The experimental results show that it reduces the processing time about 86% than that of bit plane sequential scheme. A Field Programmable Gate Array (FPGA) prototype chip is designed and simulation results show that it can process 512×512 gray-scaled images with more than 30 frames per second at 52MHz.

QP-FREE,TRUNCATED HYBRID METHODS FOR LARGE-SCALE NONLINEAR CONSTRAINED OPTIMIZATION

In this paper, a truncated hybrid method is proposed and developed for solving sparse large-scale nonlinear programming problems. In the hybrid method, a symmetric system of linear equations, instead of the usual quadratic programming subproblems, is solved at iterative process. In order to ensure the global convergence, a method of multiplier is inserted in iterative process. A truncated solution is determined for the system of linear equations and the unconstrained subproblems are solved by the limited memory BFGS algorithm such that the hybrid algorithm is suitable to the large-scale problems. The local convergence of the hybrid algorithm is proved and some numerical tests for medium-sized truss problem are given.

A Novel Low-Dimensional Method for Analytically Solving Partial Differential Equations

This paper is concerned with a low-dimensional dynamical system model for analytically solving partial differential equations(PDEs).The model proposed is based on a posterior optimal truncated weighted residue(POT-WR)method,by which an infinite dimensional PDE is optimally truncated and analytically solved in required condition of accuracy.To end that,a POT-WR condition for PDE under consideration is used as a dynamically optimal control criterion with the solving process.A set of bases needs to be constructed without any reference database in order to establish a space to describe low-dimensional dynamical system that is required.The Lagrangian multiplier is introduced to release the constraints due to the Galerkin projection,and a penalty function is also employed to remove the orthogonal constraints.According to the extreme principle,a set of ordinary differential equations is thus obtained by taking the variational operation of the generalized optimal function.A conjugate gradient algorithm by FORTRAN code is developed to solve the ordinary differential equations.The two examples of one-dimensional heat transfer equation and nonlinear Burgers’equation show that the analytical results on the method proposed are good agreement with the numerical simulations and analytical solutions in references,and the dominant characteristics of the dynamics are well captured in case of few bases used only.