The block layered space-time codes, with the intent of simultaneously achieving high coding gain and high code rate, have been suggested. These codes are based on the design principles of existing layered space-time codes and space-time block codes. The previously known concept of a layer has been modified to a block layer wherein a block layer has more than one antenna transmitting at the same...

We present an algorithm for the approximation of bivariate functions by “low-rank splines”, that is, sums of outer products of univariate splines. Our approach is motivated by the Adaptive Cross Approximation (ACA) algorithm for low-rank matrix approximation as well as the use of low-rank function approximation in the recent extension of the chebfun package to two dimensions. We show that our p...

Since their early application to elliptic partial differential equations, multigrid methods have been applied successfully to a large and growing class of problems, from elasticity and computational fluid dynamics to geodetics and molecular structures. Classical multigrid begins with a two-grid process. First, iterative relaxation is applied, whose effect is to smooth the error. Then a coarse-g...

Latent Gaussian models are flexible models that are applied in several statistical applications. When posterior marginals or full conditional distributions in hierarchical Bayesian inference from these models are not available in closed form, Markov chain Monte Carlo methods are implemented. The component dependence of the latent field usually causes increase in computational time and divergenc...

Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.

We study genetic algorithms (GAs)-based identiica-tion for nonlinear systems in the presence of unknown driving noise, using both feedforward multilayer neu-ral network models and radial basis function network models. Under perfect state measurements, we rst show that a standard GA-based estimation scheme, in its full potential, even though leading to a satisfactory model for state estimation, ...

We consider the offline scheduling problem of minimizing the makespan on m parallel and identical machines with certain feature. Every job and machine are labeled with the grade of service (GoS) levels, and each job can only be processed by the machine whose GoS level is no more than that of the job. In this paper, we present a polynomial time approximation scheme (PTAS) with running time O(n l...

We present an evaluation of the non-mesonic decay widths for Λ-hypernuclei (ΛN → NN , ΛNN → NNN) within the framework of the polarization propagator method. The full Λ self-energy is evaluated microscopically in nuclear matter by using the functional approach, which supplies a theoretically well grounded approximation scheme for the classification of the relevant diagrams, according to the pres...

This work concerns the solution of generalized Riemann problems. To this end, we consider the ADER scheme of Titarev & Toro (2002), which relies on a generalization of the classical Godunov scheme. Another solution method is the power series expansion of LeFloch & Raviart (1988). We analyze the two resulting approximation schemes, where we show that for scalar 1d problems the Toro-Titarev solve...

This paper presents a semi-implicit numerical method for the simulation of grain growth in two dimensions with a multi phase field model. To avoid the strong stability condition of traditional explicit methods, a first-order, semi-implicit discretisation scheme is employed, which offers a good compromise with regard to memory intensity and computational requirements. A nonlinear multigrid solve...