A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

A modern approach to the solution and analysis of the Simha-Somcynsky model for the description of pressure-volume-temperature properties of polymer fluids

We revisit the Simha-Somcynsky model of polymer fluids with the purpose of developing novel theoretical and computational approaches to simplify and speed up its solution as well as the fitting of experimental data, and decrease its level of mathematical complexity. We report a novel method that allows us to solve one of the two equations of the model exactly, thus putting the level of mathematical difficulty on a par with the one of other models for polymer fluids. Moreover, we describe a computational algorithm capable of fitting all five parameters of the model in an unbiased way. The results obtained reproduce literature results and fit experimental pressure-volume-temperature and solubility parameter data for three polymers very accurately. Moreover, the new techniques allow for the investigation of the model at very low temperatures. Unexpectedly, the model predicts behaviors that could be interpreted as a glass transition, as routinely observed in dilatometry and differential scanning calorimetry, and a glass phase. We compared the predicted and experimental T g’s for cis poly(1,4-butadiene) and found an excellent quantitative agreement.     

Effect of additive length and chemistry on the morphology of blends of conjugated thiophenes and fullerene derivative acceptor molecules

Small molecule additives have been shown to increase the device efficiency of conjugated polymer (donor) and fullerene derivative (acceptor) based organic solar cells by modifying the morphology of the device active layer. In this paper we conduct a systematic study of how additives affect the donor‐acceptor morphology using molecular dynamics simulations of blends of thiophene‐based oligomers, mimicking poly(3‐dodecylthiophene) (P3DDT) or poly(2,2′:5′,2”‐3,3”‐didocyl‐terthiophene) (PTTT), and fullerene derivatives with additives of varying length and chemical functionalization, mimicking experimentally used additives like methyl ester additives, diiodooctane, and alkanedithiols. We find that functionalization of additives with end groups that are attracted to acceptor molecules are necessary to induce increased donor‐acceptor macrophase separation. In blends where acceptors intercalate between oligomer alkyl side chains, functionalized additives decrease acceptor intercalation. Functionalized additives with shorter alkyl segments increase acceptor macrophase separation more than additives with same chemical functionalization but longer alkyl segments. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1046–1057     

Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.     

Lagrangian for the t–J Model Constructed from the Generators of the Supersymmetric Hubbard Algebra

In order to describe the dynamics of the t–J model, two different families of first-order Lagrangians in terms of the generators of the Hubbard algebra are found. Such families correspond to different dynamical second-class constrained systems. The quantization is carried out by using the path-integral formalism. In this context the introduction of proper ghost fields is needed to render the model renormalizable. In each case the standard Feynman diagrammatics is obtained and the renormalized physical quantities are computed and analyzed. In the first case a nonperturbative large-N expansion is considered with the purpose of studying the generalized Hubbard model describing N-fold-degenerate correlated bands. In this case the 1/N correction to the renormalized boson propagator is computed. In the second case the perturbative Lagrangian formalism is developed and it is shown how propagators and vertices can be renormalized to each order. In particular, the renormalized ferromagnetic magnon propagator coming from our formalism is studied in details. As an example the thermal softening of the magnon frequency is computed. The antiferromagnetic case is also analyzed, and the results are confronted with previous one obtained by means of the spin-polaron theories.     

Linearization of column responses by correlation chromatography. Separation improvement and reduction of undesired adsorption effects

Summary Experiments and simulations prove that correlation chromatography can greatly reduce the disadvantage of a non-linear response of the chromatographic column. A factor that has been accepted as being an important source of error in correlation or multiplex chromatography, has been shown not to be. Separations affected, improve dramatically when correlation chromatography is used, and a substantial amount of correlation noise only arises when there is a large difference in separation between a conventional chromatogram and a correlogram.A model has been developed for simulating these nonlinearities. It is shown that, especially for correlation chromatography, the simulation results match the practical measurements very well.     

固体力学有限元体系的结构拓扑变化理论

本文是文[1]的继续.文[1]提出了杆件系统的结构拓扑变化理论和拓扑变化法本文将这一理论和方法推进到连续体有限元体系;且在此基础上揭示出有限元体系的一个新性质,称为基本位移之梯度的正交性定理,从而给出一套设计敏度的显式表达式,可直接用于计算.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.