Quark matter nucleation in hot hadronic matter

We study the quark deconfinement phase transition in hot β-stable hadronic matter. Assuming a first order phase transition, we calculate the enthalpy per baryon of the hadron–quark phase transition. We calculate and compare the nucleation rate and the nucleation time due to thermal and quantum nucleation mechanisms. We compute the crossover temperature above which thermal nucleation dominates the finite temperature quantum nucleation mechanism. We next discuss the consequences for the physics of proto-neutron stars. We introduce the concept of limiting conversion temperature and critical mass M_cr for proto-hadronic stars, and we show that proto-hadronic stars with a mass M<M_cr could survive the early stages of their evolution without decaying to a quark star.     

A class of third-order nonlinear evolution equations admitting invariant subspaces and associated reductions

With the aid of symbolic computation by Maple, a class of third-order nonlinear evolution equations admitting invariant subspaces generated by solutions of linear ordinary differential equations of order less than seven is analyzed. The presented equations are either solved exactly or reduced to finite-dimensional dynamical systems. A number of concrete examples admitting invariant subspaces generated by power, trigonometric and exponential functions are computed to illustrate the resulting theory.     

A new difference scheme with high accuracy and absolute stability for solving convection–diffusion equations

In this paper, we use a semi-discrete and a padé approximation method to propose a new difference scheme for solving convection–diffusion problems. The truncation error of the difference scheme is O(h⁴+τ⁵). It is shown through analysis that the scheme is unconditionally stable. Numerical experiments are conducted to test its high accuracy and to compare it with Crank–Nicolson method.     

Rational approximation to trigonometric operators

We consider the approximation of trigonometric operator functions that arise in the numerical solution of wave equations by trigonometric integrators. It is well known that Krylov subspace methods for matrix functions without exponential decay show superlinear convergence behavior if the number of steps is larger than the norm of the operator. Thus, Krylov approximations may fail to converge for unbounded operators. In this paper, we propose and analyze a rational Krylov subspace method which converges not only for finite element or finite difference approximations to differential operators but even for abstract, unbounded operators. In contrast to standard Krylov methods, the convergence will be independent of the norm of the operator and thus of its spatial discretization. We will discuss efficient implementations for finite element discretizations and illustrate our analysis with numerical experiments. AMS subject classification (2000)  65F10, 65L60, 65M60, 65N22     

On hyperinvariant subspaces of contraction operators on a Banach space whose spectrum contains the unit circle

In this paper, we prove that every operator in a class of contraction operators on a Banach space whose spectrum contains the unit circle has a nontrivial hyperinvariant subspace. This research is supported by the Natural Science Foundation of P. R. China (No. 10771039)     

Dynamic evolution of economically preferred facilities

In a sustained development scenario, it is often the case that an investment is to be made over time in facilities that generate benefits. The benefits result from joint synergies between the facilities expressed as positive utilities specific to some subsets of facilities. As incremental budgets to finance fixed facility costs become available over time, additional facilities can be opened. The question is which facilities should be opened in order to guarantee that the overall benefit return over time is on the highest possible trajectory. This problem is common in situations such as ramping up a communication or transportation network where the facilities are hubs or service stations, or when introducing new technologies such as alternative fuels for cars and the facilities are fueling stations, or when expanding the production capacity with new machines, or when facilities are functions in a developing organization that is forced to make choices of where to invest limited funding.     

Orthogonal similarity transformation into block‐semiseparable matrices of semiseparability rank k

Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd.     

幂集上的线性空间

将线性空间的概念提升到线性空间的幂集上进行讨论,给出了线性空间的幂空间的定义,并研究了一种特殊幂空间的基本性质.     

Preconditioning techniques for iterative solvers in the Discrete Sources Method

Different preconditioning techniques for the iterative method MinRes as solver for the Discrete Sources Method (DSM) are presented. This semi-analytical method is used for light scattering computations by particles in the Mie scattering regime. Its numerical schema includes a linear least-squares problem commonly solved using the QR decomposition method. This could be the subject of numerical difficulties and instabilities for very large particles or particles with extreme geometry. In these cases, we showed that iterative methods with preconditioning techniques can provide a satisfying solution.In our previous paper, we studied four different iterative solvers (RGMRES, BiCGStab, BiCGStab(l), and MinRes) considering the performance and the accuracy of a solution. Here, we study several preconditioning techniques for the MinRes method for a variety of oblate and prolate spheroidal particles of different size and geometrical aspect ratio. Using preconditioning techniques we highly accelerated the iterative process especially for particles with a higher aspect ratio.     

Implementation and investigation of iterative solvers in the Discrete Sources Method

The implementation of iterative methods as solvers for the Discrete Sources Method (DSM) is presented. In this method, light scattering computation linear systems with dense and relative small matrices are generated. The linear systems are traditionally solved using the QR-decomposition method. For large particles or particles with extreme geometries even this commonly stable solver can fail. In these cases, we expect that iterative methods can provide a satisfying solution nevertheless.We will present our investigation in two consecutive papers. Here, we study four different iterative solvers (RGMRES, BiCGStab, BiCGStab(l), and MinRes) considering the performance and the accuracy for typical light scattering problems. Using these iterative methods we increased the quality of a solution, especially for oblate spheroids with a higher aspect ratio. Preconditioning technique is considered in the following paper.