Amine‐blocked polyisocyanates. I. Synthesis of novel N‐methylaniline‐blocked polyisocyanates and deblocking studies using hot‐stage fourier transform infrared spectroscopy

A series of substituted N‐methylaniline‐blocked polyisocyanates based on 4,4′‐methylenebis(phenyl isocyanate) and poly(tetrahydrofuran) were prepared and characterized thoroughly with FTIR, ¹H NMR, and ¹³C NMR spectroscopy methods. Compared with unsubstituted N‐methylaniline, a blocking agent with an electron‐releasing substituent at the para position took a shorter time, whereas those with an electron‐releasing substituent at the ortho position or an electron‐withdrawing substituent at the ortho and para positions took longer times for the blocking reaction. The thermal dissociation reactions of blocked polyisocyanates were carried out with an FTIR spectrophotometer attached to hot‐stage accessories under dynamic and isothermal conditions. The dynamic method was used to determine the deblocking temperature, and the isothermal method was used to calculate the deblocking kinetics and activation parameters. The cure times of blocked polyisocyanates with hydroxyl‐terminated polybutadiene were also determined. The deblocking temperatures, the results of cure‐time studies, and the kinetic parameters revealed that the thermal dissociation of the N‐methylaniline‐blocked polyisocyanates was retarded by electron‐donating substituents and facilitated by electron‐withdrawing substituents. The action of N‐methylanilines as blocking agents for isocyanate was explained by the formation of a four‐center, intramolecularly hydrogen‐bonded ring structure during the thermal dissociation of the blocked polyisocyanates. The formation of such a hydrogen‐bonded ring structure was confirmed and supported by variable‐temperature ¹H NMR studies and entropy parameters, respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1557–1570, 2007     

Solution of the hyperbolic mild‐slope equation using the finite volume method

A finite volume solver for the 2D depth‐integrated harmonic hyperbolic formulation of the mild‐slope equation for wave propagation is presented and discussed. The solver is implemented on unstructured triangular meshes and the solution methodology is based upon a Godunov‐type second‐order finite volume scheme, whereby the numerical fluxes are computed using Roe's flux function. The eigensystem of the mild‐slope equations is derived and used for the construction of Roe's matrix. A formulation that updates the unknown variables in time implicitly is presented, which produces a more accurate and reliable scheme than hitherto available. Boundary conditions for different types of boundaries are also derived. The agreement of the computed results with analytical results for a range of wave propagation/transformation problems is very good, and the model is found to be virtually paraxiality‐free. Copyright © 2003 John Wiley & Sons, Ltd.     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

Incremental unknowns preconditioning for solving the Helmholtz equation

An efficient preconditioner is developed for solving the Helmholtz problem in both high and low frequency (wavenumber) regimes. The preconditioner is based on hierarchical unknowns on nested grids, known as incremental unknowns (IU). The motivation for the IU preconditioner is provided by an eigenvalue analysis of a simplified Helmholtz problem. The performance of our preconditioner is tested on the iterative solution of two‐dimensional electromagnetic scattering problems. When compared with other well‐known methods, our technique is shown to often provide a better numerical efficacy and, most importantly, to be more robust. Moreover, for the best performance, the number of IU levels used in the preconditioner should be designed for the coarsest grid to have roughly two points per linear wavelength. This result is consistent with the conventional sampling criteria for wave phenomena in contrast with existing IU applications for solving the Laplace/Poisson problem, where the coarsest grid comprises just one interior point. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

Dynamical Running Mass of Quark in the Dyson-Schwinger Equation Approach

Based on the Dyson-Schwinger equations of QCD in the "rainbow" approximation, the fully dressed quarkpropagator Sf(p) is investigated, and then an algebraic parametrization form of the propagator is obtained as a solutionof the equations. The dressed quark amplitudes Af and Bf built up the fully dressed quark propagator and the dynamicalrunning masses Mf defined by Af and Bf for light quarks u, d and s are calculated, respectively. Using the predictedrunning masses Mf, quark condensates <0|q(0)q(0)|0> = -(0.255 GeV)a for u, d quarks, and <0|s s|0> = 0.8<0|q(0)q(0)]0)for s quark, and experimental pion decay constant fπ = 0.093 GeV, the masses of Goldstone bosons K, π, and η are alsoevaluated. The numerical results show that the masses of quarks are dependent on their momentum p2. The fully dressedquark amplitudes Af and Bf have correct behaviors which can be used for many purposes in our future researches onnonperturbative QCD.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A marker method for the solution of the damped Burgers' equation

A new method for the solution of the damped Burgers' equation is described. The marker method relies on the definition of a convective field associated with the underlying partial differential equation; the information about the approximate solution is associated with the response of an ensemble of markers to this convective field. Some key aspects of the method, such as the selection of the shape function and the initial loading, are discussed in some details. The marker method is applicable to a general class of nonlinear dispersive partial differential equations. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006