Search

Let W be a unitary left R-module on associative ring R with identity. A submodule F of W is called R-annihilator small if F+T=W, where T is a submodule of W, implies that ann(T)=0, where ann(T) indicates annihilator of T in R. In this paper, we introduce the concepts of R-annihilator-coessential and R- annihilator - coclosed submodules. We give many properties related with these types of submodules. [ABSTRACT FROM AUTHOR]

This paper is concerned with an ordinary non-linear differential equation that occurs in the theory of thermal explosion and, for the spherically symmetric case, in the theory of stellar structure. For plane and axial symmetry, closed form solutions are well known, but the spherically symmetric case can so far only be obtained numerically. By examining the problem in the phase plane, Enig (1967, Critical parameters in the Poisson-Boltzmann equation of steady-state thermal explosion theory. Combust. Flame, 10, 197–199enig1967 was able to obtain an equation from which the critical parameters of the equations can be determined. The equation is of Abel type and there is some difficulty in determining an integrating factor. We note that the partial differential equation for the integrating factor is more difficult to solve then the original equation. A general method is presented that allows the solution to be found in parametric form. Methods of solution for the spherically symmetric case have been presented by various authors. It is shown that these may all be reduced to the equation of Enig. The spherically symmetric case has been examined in some detail near its singular point. In a brilliant but largely ignored paper, it was Jules Enig who first discovered the existence of a vortex in the phase plane. It is hoped that my contribution has solved some of the mysteries of the vortex. [ABSTRACT FROM PUBLISHER]

Abstract: One of the particularities of information encoded as DNA strands is that a string u contains basically the same information as its Watson–Crick complement, denoted here as . Thus, any expression consisting of repetitions of u and can be considered in some sense periodic. In this paper, we give a generalization of Lyndon and Schützenberger’s classical result about equations of the form , to cases where both sides involve repetitions of words as well as their complements. Our main results show that, for such extended equations, if , then all three words involved can be expressed in terms of a common word t and its complement . Moreover, if , then is an optimal bound. These results are established based on a complete characterization of all possible overlaps between two expressions that involve only some word u and its complement , which is also obtained in this paper. [Copyright &y& Elsevier]

Surface roughness is often considered the main purpose in contemporary computer numerical controlled (CNC) machining industry. Most existing optimization researches for CNC finish turning were either accomplished within certain manufacturing circumstances or achieved through numerous equipment operations. Therefore, a general deduction optimization scheme is deemed to be necessary for the industry. In this paper, the cutting depth, feed rate, speed, and tool nose runoff with low, medium, and high level are considered to optimize the surface roughness for finish turning based on L9(34) orthogonal array. Additionally, nine fuzzy control rules using triangle membership function with respective to five linguistic grades for surface roughness are constructed. Considering four input and twenty output intervals, the defuzzification using center of gravity is then completed. Thus, the optimum general fuzzy linguistic parameters can then be received. The confirmation experiment result showed that the surface roughness from the fuzzy linguistic optimization parameters is significantly advanced compared to that from the benchmark. This paper certainly proposes a general optimization scheme using orthogonal array fuzzy linguistic approach to the surface roughness for CNC turning with profound insight. [ABSTRACT FROM AUTHOR]

Some preconditioners for accelerating the classical iterative methods are given in Zhang et al. [Y. Zhang and T.Z. Huang, A class of optimal preconditioners and their applications, Proceedings of the Seventh International Conference on Matrix Theory and Its Applications in China, 2006. Y. Zhang, T.Z. Huang, and X.P. Liu, Modified iterative methods for nonnegative matrices and M-matrices linear systems, Comput. Math. Appl. 50 (2005), pp. 1587-1602. Y. Zhang, T.Z. Huang, X.P. Liu, A class of preconditioners based on the (I+S(α))-type preconditioning matrices for solving linear systems, Appl. Math. Comp. 189 (2007), pp. 1737-1748]. Another kind of preconditioners approximating the inverse of a symmetric positive definite matrix was given in Simons and Yao [G. Simons, Y. Yao, Approximating the inverse of a symmetric positive definite matrix, Linear Algebra Appl. 281 (1998), pp. 97-103]. Zhang et al. 's preconditioners and Simons and Yao's are generalized in this paper. These preconditioners are all of low construction cost, which all could be taken as approximate inverse of M-matrices. Numerical experiments of these preconditioners applied with Krylov subspace methods show the effectiveness and performance, which also show that the preconditioners proposed in this paper are better approximate inverse for M-matrices than Simons'. [ABSTRACT FROM AUTHOR]

In the paper cited in the heading, we treated the problem of stabilizing a flexible cable with two rigid loads, which was described by two kinds of hyperbolic equations. To show the asymptotic stability of the closed-loop system with a controller derived there, we used the LaSalle's invariance principle. However, in that paper, we need to supplement the proof of Theorem 5.1 and to revise the proof of Theorem 5.2. Throughout this note, we use the same notation as in the paper cited in the heading. [ABSTRACT FROM PUBLISHER]

The purpose of the paper is to determine fine spectrum of newly introduced operator Δν on the sequence space c0. The operator Δν on c0 is defined by Δνχ = (νnχn - νn-1χn-1)n=0∞ with χ-1 = 0, where ν = (νk) is either constant or strictly decreasing sequence of positive real numbers such that lim νk = L > 0 and sup νk ≤ 2L. In this paper, it is shown that spectrum (These equations cannot be represented into ASCII text), the point spectrum σp(Δν,c0) = ϕ if ν is a constant and σp(Δν,c0) = {νn} if ν is a strictly decreasing sequence. We have also obtained the results on continuous spectrum σc(Δν,c0), residual spectrum σr(Δν,c0) and fine spectrum of the operator Δν on c0. [ABSTRACT FROM AUTHOR]

In this paper we are interested in the global existence and large time behavior of solutions to the initial- boundary value problem for sub critical nonlinear dissipative equations (Multiple line equation(s) cannot be represented in ASCII text) where the nonlinear term N(u, ux) depends on the unknown function u and its derivative ux and satisfy the estimate (Multiple line equation(s) cannot be represented in ASCII text)The linear operator IK(u) is defined as follows (Multiple line equation(s) cannot be represented in ASCII text) where the constants an, am ϵ R, n, m are integers, m > n. The aim of this paper is to prove the global existence of solutions to the initial-boundary value Problem (1). We find the main term of the asymptotic representation of solutions in sub critical case, when the nonlinear term of equation has the time decay rate less then that of the linear terms. Also we give some general approach to obtain global existence of solution of initial-boundary value problem in sub critical case and elaborate general sufficient conditions to obtain asymptotic expansion of solution. [ABSTRACT FROM AUTHOR]

Abstract: The scope of the present study is Eulerian modeling and simulation of polydisperse liquid sprays undergoing droplet coalescence and evaporation. The fundamental mathematical description is the Williams spray equation governing the joint number density function of droplet volume and velocity. Eulerian multi-fluid models have already been rigorously derived from this equation in Laurent et al. [F. Laurent, M. Massot, P. Villedieu, Eulerian multi-fluid modeling for the numerical simulation of coalescence in polydisperse dense liquid sprays, J. Comput. Phys. 194 (2004) 505–543]. The first key feature of the paper is the application of direct quadrature method of moments (DQMOM) introduced by Marchisio and Fox [D.L. Marchisio, R.O. Fox, Solution of population balance equations using the direct quadrature method of moments, J. Aerosol Sci. 36 (2005) 43–73] to the Williams spray equation. Both the multi-fluid method and DQMOM yield systems of Eulerian conservation equations with complicated interaction terms representing coalescence. In order to focus on the difficulties associated with treating size-dependent coalescence and to avoid numerical uncertainty issues associated with two-way coupling, only one-way coupling between the droplets and a given gas velocity field is considered. In order to validate and compare these approaches, the chosen configuration is a self-similar 2D axisymmetrical decelerating nozzle with sprays having various size distributions, ranging from smooth ones up to Dirac delta functions. The second key feature of the paper is a thorough comparison of the two approaches for various test-cases to a reference solution obtained through a classical stochastic Lagrangian solver. Both Eulerian models prove to describe adequately spray coalescence and yield a very interesting alternative to the Lagrangian solver. The third key point of the study is a detailed description of the limitations associated with each method, thus giving criteria for their use as well as for their respective efficiency. [Copyright &y& Elsevier]

We show how to prescribe the initial data of a characteristic problem satisfying the constraints, the smallness, the regularity and the asymptotic decay suitable to prove a global existence result. In this paper, the first of two, we show in detail the construction of the initial data and give a sketch of the existence result. This proof, which mimicks the analogous one for the non-characteristic problem in [19], will be the content of a subsequent paper. [ABSTRACT FROM AUTHOR]

This paper deals with a fully implicit time discretization scheme with variable time-step for a nonlinear system modelling phase transition and mechanical deformations in shape memory alloys. The model is studied in the non-stationary case and accounts for local microscopic interactions between the phases introducing the gradients of the phase parameters. The resulting initial-boundary value problem has already been studied by the author who proved existence, uniqueness and continuous dependence on data for a suitable weak solution along some regularity results. A careful and detailed investigation of the variable time-step discretization is the goal of this paper. Thus, we deduce some estimates for the discretization error. These estimates depend only on data, impose no constraints between consecutive time-steps and show an optimal order of convergence. Finally, we prove another regularity result for the solution under stronger regularity assumptions on data. [ABSTRACT FROM AUTHOR]

This paper is concerned with the ill-posed problems of identifying a parameter in an elliptic equation which appears in may applications in science and industry. Its solution is obtained by applying trust region method to a nonlinear least squares error problem. Trust region method has long been a popular method for well-posed problems. This paper indicates that it is also suitable for all-posed problems. Numerical experiment is given to compare the trust region method with the Tikhonov regularization method. It seems that the trust region method is more promising. [ABSTRACT FROM AUTHOR]

In this paper we apply the generalized Taylor­Galerkin finite element model to simulate bore wave propagation in a domain of two dimensions. For stability and accuracy reasons, we generalize the model through the introduction of four free parameters. One set of parameters is rig- orously determined to obtain the high-order finite element solution. The other set of free parameters is determined from the underlying discrete maximum principle to obtain the monotonic solutions. The resulting two models are used in combination through the flux correct transport technique of Zalesak, thereby constructing a finite element model which has the ability to capture hydraulic dis- continuities. In addition, this paper highlights the implementation of two Krylov subspace iterative solvers, namely, the bi-conjugate gradient stabilized (Bi-CGSTAB) and the generalized minimum residual (GMRES) methods. For the sake of comparison, the multifrontal direct solver is also con- sidered. The performance characteristics of the investigated solvers are assessed using results of a standard test widely used as a benchmark in hydraulic modeling. Based on numerical results, it is shown that the present finite element method can render the technique suitable for solving shallow water equations with sharply varying solution profiles. Also, the GMRES solver is shown to have a much better convergence rate than the Bi-CGSTAB solver, thereby saving much computing time compared to the multifrontal solver. [ABSTRACT FROM AUTHOR]

In this paper we consider domain decomposition methods for solving the radial basis function interpolation equations. There are three interwoven threads to the paper. The first thread provides good ways of setting up and solving small- to medium-sized radial basis function interpolation problems. These may occur as subproblems in a domain decomposition solution of a larger interpolation problem. The usual formulation of such a problem can suffer from an unfortunate scale dependence not intrinsic in the problem itself. This scale dependence occurs, for instance, when fitting polyharmonic splines in even dimensions. We present and analyze an alternative formulation, available for all strictly conditionally positive definite basic functions, which does not suffer from this drawback, at least for the very important example previously mentioned. This formulation changes the problem into one involving a strictly positive definite symmetric system, which can be easily and efficiently solved by Cholesky factorization. The second section considers a natural domain decomposition method for the interpolation equations and views it as an instance of von Neumann's alternating projection algorithm. Here the underlying Hilbert space is the reproducing kernel Hilbert space induced by the strictly conditionally positive definite basic function. We show that the domain decomposition method presented converges linearly under very weak nondegeneracy conditions on the possibly overlapping subdomains. The last section presents some algorithmic details and numerical results of a domain decomposition interpolatory code for polyharmonic splines in 2 and 3 dimensions. This code has solved problems with 5 million centers and can fit splines with 10,000 centers in approximately 7 seconds on very modest hardware. [ABSTRACT FROM AUTHOR]

In this paper we extend previous results on the regularity of solutions of integro-differential parabolic equations. The kernels are non-necessarily symmetric which could be interpreted as a non-local drift with the same order as the diffusion. We provide a growth lemma and a Harnack inequality which can be used to prove higher regularity estimates. [ABSTRACT FROM AUTHOR]

The second boundary value problem of the prescribed affine mean curvature equation is a nonlinear, fourth order, geometric partial differential equation. It was introduced by Trudinger and Wang in 2005 in their investigation of the affine Plateau problem in affine geometry. The previous works of Trudinger–Wang, Chau–Weinkove and the author solved this global problem in W 4 , p under some restrictions on the sign or integrability of the affine mean curvature. We remove these restrictions in this paper and obtain W 4 , p solution to the second boundary value problem when the affine mean curvature belongs to L p with p greater than the dimension. Our self-contained analysis also covers the case of Abreu's equation. [ABSTRACT FROM AUTHOR]

This paper deals with the solvability of interval matrix equations in max-plus algebra. Max-plus algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗, where a ⊕ b = max ⁡ { a , b } and a ⊗ b = a + b . The notation A ⊗ X ⊗ C = B represents an interval max-plus matrix equation, where A , B , and C are given interval matrices. We define four types of solvability of interval max-plus matrix equations, i.e., the tolerance, weak tolerance, left-weak tolerance, and right-weak tolerance solvability. We derive the necessary and sufficient conditions for checking each of them, whereby all can be verified in polynomial time. [ABSTRACT FROM AUTHOR]

Tensor computation is intensive and difficult. Invariably, a vital component is the truncation of tensors, so as to control the memory and associated computational requirements. Various tensor toolboxes have been designed for such a purpose, in addition to transforming tensors between different formats. In this paper, we propose a simple Q-less QR truncation technique for tensors { x ( i ) } with x ( i ) ∈ R n 1 × ⋯ × n d in the simple and natural Kronecker product form. It generalizes the QR decomposition with column pivoting, adapting the well-known Gram–Schmidt orthogonalization process. The main difficulty lies in the fact that linear combinations of tensors cannot be computed or stored explicitly. All computations have to be performed on the coefficients α i in an arbitrary tensor v = ∑ i α i x ( i ) . The orthonormal Q factor in the QR decomposition X ≡ [ x ( 1 ) , ⋯ , x ( p ) ] = Q R cannot be computed but expressed as X R − 1 when required. The resulting algorithm has an O ( p 2 d n ) computational complexity, with n = max ⁡ n i . Some illustrative examples in the numerical solution of tensor linear equations are presented. [ABSTRACT FROM AUTHOR]

The Frequency Difference of Arrival (FDOA) equations derived in this paper are intended to increase the standard accuracy of the Low Earth Orbit (LEO) satellites dedicated to locate non-cooperative emitters placed on the Earth surface or in orbit about the Earth. The equations contain terms that are of the order of the corrections already taken into account in Navigation by GPS. In particular, two of them should not be neglected to this end, since they can be of the order of 10 − 10 . [ABSTRACT FROM AUTHOR]

Finding the solution of the absolute value equation (AVE) A x − | x | = b has attracted much attention in recent years. In this paper, we propose a relaxed nonlinear PHSS-like iterative method, which is more efficient than the Picard-HSS iterative method for the AVE, and is a generalization of the nonlinear HSS-like iteration method for the AVE. By using the theory of nonsmooth analysis, we prove the convergence of the relaxed nonlinear PHSS-like iterative method for the AVE. Numerical experiments are given to demonstrate the feasibility, robustness and effectiveness of the relaxed nonlinear HSS-like method. [ABSTRACT FROM AUTHOR]

This paper is concerned with refinement equations of the type [This symbol cannot be presented in ASCII format] where f is the unknown function defined on the s-dimensional Euclidean space Rs, a is a finitely supported sequence on Zs, and M is an s × s dilation matrix with m := | det M|. The solution of a refinement equation can be obtained by using the subdivision scheme associated with the mask. In this paper we give a characterization for the convergence of the subdivision scheme when the mask is nonnegative. Our method is to relate the problem of convergence to m column-stochastic matrices induced by the mask. In this way, the convergence of the subdivision scheme can be determined in a finite number of steps by checking whether each finite product of those column-stochastic matrices has a positive row. As a consequence of our characterization, we show that the convergence of the subdivision scheme with a nonnegative mask depends only on the location of its positive coefficients. Several examples are provided to demonstrate the power and applicability of our approach. [ABSTRACT FROM AUTHOR]

In the analysis of a discrete nonlinear system, one of the important problems is to derive a steady solution for the nonlinear difference equation characterizing the system. However, the study for the solution method of the difference system has not been sufficient, and examples of the methods being applied to the parametric oscillation are few. This paper presents a method which derives the steady solution for the quasi-linear difference equation containing a periodic parametric excitation in its weakly nonlinear function with small parameter ∊. In this method the harmonic balance and the averaging methods used in the solution of the continuous nonlinear differential equation are ape plied to the discrete system. Since the non-linear term in the equation is bounded by ∊, the discrete waveform in the steady state is almost sinusoidal. This paper presents numerical examples for the solutions by the two methods, assuming the solution as the discrete oscillation corresponding to the sinusoid of the continuous system. As a result, the same solution is obtained by either method. Comparing the result with the output waveform obtained directly by the numerical calculation for the fundamental equation, the validity of the approximate solution by the proposed method was verified. [ABSTRACT FROM AUTHOR]

In this paper, the forecasting equations of a 2nd-order space-time differential remainder are deduced from the Navier-Stokes primitive equations and Eulerian operator by Taylor-series expansion. Here we introduce a cubic spline numerical model (Spline Model for short), which is with a quasi-Lagrangian time-split integration scheme of fitting cubic spline/ bicubic surface to all physical variable fields in the atmospheric equations on spherical discrete latitude-longitude mesh. A new algorithm of "fitting cubic spline--time step integration_fitting cubic spline--......" is developed to determine their first- and 2nd-order derivatives and their upstream points for time discrete integral to the governing equations in Spline Model. And the cubic spline function and its mathematical polarities are also discussed to understand the Spline Model's mathematical foundation of numerical analysis. It is pointed out that the Spline Model has mathematical laws of "convergence" of the cubic spline functions contracting to the original functions as well as its 1st-order and 2nd-order derivatives. The "optimality" of the 2nd-order derivative of the cubic spline functions is optimal approximation to that of the original functions. In addition, a Hermite bicubic patch is equivalent to operate on a grid for a 2nd-order derivative variable field. Besides, the slopes and curvatures of a central difference are identified respectively, with a smoothing coefficient of 1/3, three-point smoothing of that of a cubic spline. Then the slopes and curvatures of a central difference are calculated from the smoothing coefficient 1/3 and three-point smoothing of that of a cubic spline, respectively. Furthermore, a global simulation case of adiabatic, non-frictional and "incompressible" model atmosphere is shown with the quasi-Lagrangian time integration by using a global Spline Model, whose initial condition comes from the NCEP reanalysis data, along with quasi-uniform latitude-longitude grids and the so-called "shallow atmosphere" Navier-Stokes primitive equations in the spherical coordinates. The Spline Model, which adopted the Navier-Stokes primitive equations and quasi-Lagrangian time-split integration scheme, provides an initial ideal case of global atmospheric circulation. In addition, considering the essentially non-linear atmospheric motions, the Spline Model could judge reasonably well simple points of any smoothed variable field according to its fitting spline curvatures that must conform to its physical interpretation. [ABSTRACT FROM AUTHOR]

This paper studies linear classes of planar quasiregular mappings. We give a positive answer to a conjecture of K. Astala, T. Iwaniec, and G. Martin (2009) on reduced Beltrami equations. Moreover, we use it to prove a Wronsky-type theorem for general linear Beltrami systems. This is a key to show that the associated Beltrami equation of a linear quasiregular family is unique. [ABSTRACT FROM AUTHOR]

In this paper, we study the decay properties of the solutions to Timoshenko beam with a weak non-linear dissipation. [ABSTRACT FROM PUBLISHER]

Abstract: According to the hierarchical identification principle, a hierarchical gradient based iterative estimation algorithm is derived for multivariable output error moving average systems (i.e., multivariable OEMA-like models) which is different from multivariable CARMA-like models. As there exist unmeasurable noise-free outputs and unknown noise terms in the information vector/matrix of the corresponding identification model, this paper is, by means of the auxiliary model identification idea, to replace the unmeasurable variables in the information vector/matrix with the estimated residuals and the outputs of the auxiliary model. A numerical example is provided. [ABSTRACT FROM AUTHOR]

We present new iterative methods based on refinement process for solving large sparse Sylvester-observer equations applied in state estimation of a continuous-time system. These methods use projection methods to produce low-dimensional Sylvester-observer matrix equations that are solved by the direct methods. Moreover, the refinement process described in this paper has the capability of improving the results obtained by any other methods. Some numerical results will be reported to illustrate the efficiency of the proposed methods. [ABSTRACT FROM AUTHOR]

This paper provides some relations between the idempotent operators and the solutions to operator equations and A B A = A² and B A B = B². [ABSTRACT FROM AUTHOR]

We generalize the main result of the paper by Bennett and Mulholland ['On the diophantine equation xn + yn = 2α pz2, C. R. Math. Acad. Sci. Soc. R. Can. 28 (2006), 6-11] concerning the solubility of the diophantine equation xn + yn = 2αpz2. We also demonstrate, by way of examples, that questions about solubility of a class of diophantine equations of type (3; 3; p) or (4, 2, p) can be reduced, in certain cases, to studying several equations of the type (p, p, 2). [ABSTRACT FROM AUTHOR]

In this paper, some improved regularity criteria for the 3D viscous MHD equations are established in multiplier spaces. It is proved that if the velocity field satisfies or the gradient field of velocity satisfies then the solution remains smooth on [0, T]. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the existence of weak solutions of the coupled time-dependent Ginzburg-Landau equations and establish the global existence of weak solutions to the equations by Galerkin method and compactness theory. [ABSTRACT FROM AUTHOR]

The purpose of this study is to approximate the stream function and temperature distribution of the MHD flow in a laminar liquid film from a horizontal stretching surface. In this paper DTM-Padé method was used which is a combination of differential transform method (DTM) and Padé approximant. The DTM solutions are only valid for small values of independent variables. Comparison between the solutions obtained by the DTM and the DTM-Padé with numerical Solution (fourth-order Runge-Kutta) revealed that the DTM-Padé method is an excellent method for solving MHD boundary-layer equations. [ABSTRACT FROM AUTHOR]

He's variational iteration method (VIM) is used for solving space and time fractional telegraph equations. Numerical examples are presented in this paper. The obtained results show that VIM is effective and convenient. [ABSTRACT FROM AUTHOR]

In this paper, we study the basic results on the general study of null curves in the Minkowski 4-space R14. A transversal vector bundle of a null curve in R14 is constructed using a frenet Frame consisting of two real null and two space-like vectors. The null curves are characterized by using the Frenet frame. [ABSTRACT FROM AUTHOR]

In this paper we present rigorous a posteriori L 2 error bounds for reduced basis approximations of the unsteady viscous Burgers’ equation in one space dimension. The a posteriori error estimator, derived from standard analysis of the error-residual equation, comprises two key ingredients—both of which admit efficient Offline-Online treatment: the first is a sum over timesteps of the square of the dual norm of the residual; the second is an accurate upper bound (computed by the Successive Constraint Method) for the exponential-in-time stability factor. These error bounds serve both Offline for construction of the reduced basis space by a new POD-Greedy procedure and Online for verification of fidelity. The a posteriori error bounds are practicable for final times (measured in convective units) T≈ O(1) and Reynolds numbers ν −1≫1; we present numerical results for a (stationary) steepening front for T=2 and 1≤ ν −1≤200. [ABSTRACT FROM AUTHOR]

In this article we stochastically perturb the classical non-autonomous delay Lotka-Volterra model [image omitted] into the stochastic delay population system (SDPS) [image omitted] Different from most of the existing papers [A. Bahar and X. Mao, Stochastic delay Lotka-Volterra model, J. Math. Anal. Appl. 292 (2004), 364-380, A. Bahar and X. Mao, Stochastic delay population dynamics, J. Pure Appl. Math. 11 (2004), 377-400, X. Mao, Delay population dynamics and environmental noise, Stochastics Dyn. 5(2) (2005), pp. 149-162], the system parameters in this article are time-dependent. We will give a sufficient condition under which the SDPS will have a unique global positive solution. We will then establish some new asymptotic properties for the moments of the solution. In particular, we will discuss two fundamental problems in population systems, namely ultimate boundedness and extinction. [ABSTRACT FROM AUTHOR]

In this paper, a new technique is presented for structural acoustic analysis in the case of nonconforming acoustic–solid interface meshes. We first describe a simple method for coupling nonconforming acoustic–acoustic meshes, and then show that a similar approach, together with the coupling operators from conforming analysis, can also be applied to nonconforming structural acoustics. In the case of acoustic–acoustic interfaces, the continuity of acoustic pressure is enforced with a set of linear constraint equations. For structural acoustic interfaces, the same set of linear constraints is used, in conjunction with the weak formulation and the coupling operators that are commonly used in conforming structural acoustics. The constraint equations are subsequently eliminated using a static condensation procedure. We show that our method is equally applicable to time domain, frequency domain, and coupled eigenvalue analysis for structural acoustics. Numerical examples in both the time and frequency domains are presented to verify the methods. [ABSTRACT FROM AUTHOR]

Abstract  In this paper, we address some modelling issues related to biological growth. Our treatment is based on a formulation for growth that was proposed within the context of mixture theory (J Mech Phys Solids 52:1595–1625, 2004). We aim to make this treatment more appropriate for the physics of porous soft tissues, paying particular attention to the nature of fluid transport, and mechanics of fluid and solid phases. The interactions between transport and mechanics have significant implications for growth and swelling. We also reformulate the governing differential equations for reaction-transport of solutes to represent the incompressibility constraint on the fluid phase of the tissue. This revision enables a straightforward implementation of numerical stabilisation for the advection-dominated limit of these equations. A finite element implementation with operator splitting is used to solve the coupled, non-linear partial differential equations that arise from the theory. We carry out a numerical and analytic study of the convergence of the operator splitting scheme subject to strain- and stress-homogenisation of the mechanics of fluid–solid interactions. A few computations are presented to demonstrate aspects of the physical mechanisms, and the numerical performance of the formulation. [ABSTRACT FROM AUTHOR]

This paper deals with very weak solutions of the A-harmonic equation divA(x,∇u) = 0 with the operator A : Ω × Rn → Rn satisfies some coercivity and controllable growth conditions with Muckenhoupt weight. By using the Hodge decomposition with weight, a regularity property is proved: There exists an integrable exponent r1 = r1(λ, n, p) < p, such that every very weak solution u ϵ Wloc1,r (Ω,w). That is, u is a weak solution to (✶) in the usual sense. [ABSTRACT FROM AUTHOR]

The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. [ABSTRACT FROM AUTHOR]

This paper presents a new method to isolate all configurations that a multiloop linkage can adopt. The problem is tackled by means of formulation and resolution techniques that fit particularly well together. The adopted formulation yields a system of simple equations (only containing linear, bilinear, and quadratic monomials, and trivial trigonometric terms for the helical pair only) whose structure is later exploited by a branch-and-prune method based on linear relaxations. The method is general, as it can be applied to linkages with single or multiple loops with arbitrary topology, involving lower pairs of any kind, and complete, as all possible solutions get accurately bounded, irrespective of whether the linkage is rigid or mobile. [ABSTRACT FROM AUTHOR]

In this paper, we study first and second order positive numerical methods for the advection equation. In particular, we consider the direct discretization of the model problem and comment on its superiority to the so called method of lines. Moreover, we investigate the accuracy, stability and positivity properties of the direct discretization. The numerical results related to several test problems are reported. [ABSTRACT FROM AUTHOR]

A recent study [D. N. Arnold, D. Boffi, and R. S. Falk, SIAM J. Numer. Anal., 42 (2005), pp. 2429-2451] reveals that convergence of finite element methods using H(div , O)-compatible finite element spaces deteriorates on nonaffine quadrilateral grids. This phenomena is particularly troublesome for the lowest-order Raviart-Thomas elements, because it implies loss of convergence in some norms for finite element solutions of mixed and least-squares methods. In this paper we propose reformulation of finite element methods, based on the natural mimetic divergence operator [M. Shashkov, Conservative Finite Difference Methods on General Grids, CRC Press, Boca Raton, FL, 1996], which restores the order of convergence. Reformulations of mixed Galerkin and leastsquares methods for the Darcy equation illustrate our approach. We prove that reformulated methods converge optimally with respect to a norm involving the mimetic divergence operator. Furthermore, we prove that standard and reformulated versions of the mixed Galerkin method lead to identical linear systems, but the two versions of the least-squares method are veritably different. The surprising conclusion is that the degradation of convergence in the mixed method on nonaffine quadrilateral grids is superficial, and that the lowest-order Raviart-Thomas elements are safe to use in this method. However, the breakdown in the least-squares method is real, and there one should use our proposed reformulation. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we consider constructing some higher-order modifications of Newton’s method for solving nonlinear equations which increase the order of convergence of existing iterative methods by one or two or three units. This construction can be applied to any iteration formula, and per iteration the resulting methods add only one additional function evaluation to increase the order. Some illustrative examples are provided and several numerical results are given to show the performance of the presented methods. [Copyright &y& Elsevier]

A cross-curricular structured-probe task-based clinical interview study with 44 pairs of third year high-school mathematics students, most of whom were high achieving, was conducted to investigate their approaches to a variety of algebra problems. This paper presents results from three problems that were posed in symbolic form. Two problems are TIMSS items (a linear inequality and an equation involving square roots). The other problem involves square roots. We found that the majority of student pairs used symbol manipulation when solving the problems, and while many students seemed to prefer symbolic over graphical and tabular representations in their first attempt at solving the problems, we found that it was common for student pairs to use more than one strategy throughout the course of their solving. Students `use of graphing calculators to solve the problems is discussed. [ABSTRACT FROM AUTHOR]

Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G)̲ satisfies s ≈ t. A graph G = (V;E) is called a right self-distributive graph if the graph algebra A(G)̲ satisfies the equation ((xy)z) ≈ ((xz)(yz)). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s and t are replaced by any term operations of A̲ of the appropriate arity, the resulting identities hold in A̲. In this paper, we characterize right self-distributive graph algebras, identities and hyperidentities in right self-distributive graph algebras. [ABSTRACT FROM AUTHOR]

In this paper, we numerically study the semiclassical limit of the Schrödinger–Poisson equations as a selection principle for the weak solution of the Vlasov–Poisson in one space dimension. Our numerical results show that this limit gives the weak solution that agrees with the zero diffusion limit of the Fokker–Planck equation. We also numerically justify the multivalued solution given by a moment system of the Vlasov–Poisson equations as the semiclassical limit of the Schrödinger–Poisson equations. [ABSTRACT FROM AUTHOR]