The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 261 –
280 of
882
A class of linear elliptic operators has an important qualitative property, the so-called maximum principle. In this paper we investigate how this property can be preserved on the discrete level when an interior penalty discontinuous Galerkin method is applied for the discretization of a 1D elliptic operator. We give mesh conditions for the symmetric and for the incomplete method that establish some connection between the mesh size and the penalty parameter. We then investigate the sharpness of...
This paper studies kinematic properties of the rear axle of the particle coach as function of driver’s activity. The main goals are the prediction of the trajectory, the computation of the vector of velocity of each wheel of the rear axle as a function of the real velocity vector of the front coach axle and the real curvature of the bus trajectory. The computer algebra system MAPLE was used for all necessary computations.
This paper is concerned with the asymptotic expansion and numerical solution of systems of linear delay differential equations with highly oscillatory forcing terms. The computation of such problems using standard numerical methods is exceedingly slow and inefficient, indeed standard software is practically useless for this purpose. We propose an alternative, consisting of an asymptotic expansion of the solution, where each term can be derived either by recursion or by solving a non-oscillatory...
This paper is concerned with the asymptotic expansion and numerical solution of systems of linear delay differential equations with highly oscillatory forcing terms. The computation of such problems using standard numerical methods is exceedingly slow and inefficient, indeed standard software is practically useless for this purpose. We propose an alternative, consisting of an asymptotic expansion of the solution, where each term can be derived either by recursion or by solving a non-oscillatory...
This paper is concerned with the asymptotic expansion and numerical solution of systems of linear delay differential equations with highly oscillatory forcing terms. The computation of such problems using standard numerical methods is exceedingly slow and inefficient, indeed standard software is practically useless for this purpose. We propose an alternative, consisting of an asymptotic expansion of the solution, where each term can be derived either by recursion or by solving a non-oscillatory...
Currently displaying 261 –
280 of
882