Resumo em Inglês:

In this paper, the boundary value problems for second order singularly perturbed delay differential equations are treated. A generic numerical approach based on finite difference is presented to solve such boundary value problems. The stability and convergence analysis of the method is studied. The solution of the boundary value problems when delay is zero, exhibits layer behavior. Here, the study focuses on the effect of delay on the boundary layer behavior of the solution via numerical approach. The effect of the delay on the boundary layer behavior of the solution is shown by carrying out some numerical experiments.

Resumo em Inglês:

In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes.

Resumo em Inglês:

In this paper, a new special class of splitting iterations for solving linear least squares problems in finite dimensions is defined and their main properties of strong global convergence to any problem solution are derived. The investigation results prove the new splitting iterations to be a generalization of the approximating splitting iterations for solving linear least squares problems in finite dimensions, suggesting their suitability for the robust approximate solution of such problems.

Resumo em Inglês:

We propose an adaptive method of analyzing a collection of curves which can be, individually, modeled as a linear combination of spline basis functions. Through the introduction of latent Bernoulli variables, the number of basis functions, the variance of the error measurements and the coefficients of the expansion are determined. We provide a modification of the stochastic EM algorithm for which numerical results show that the estimates are very close to the true curve in the sense of L2 norm.

Resumo em Inglês:

Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for Goppa codes.

Resumo em Inglês:

Let C(H) denote the class of closed convex cones in a Hilbert space H. One possible way of measuring the degree of pointedness of a cone K is by evaluating the distance from K to the set of all nonpointed cones. This approach has been explored in detail in a previous work of ours. We now go beyond this particular choice and set up an axiomatic background for addressing this issue. We define an index of pointedness over H as being a function f: C(H) -> R satisfying a certain number of axioms. The number f(K) is intended, of course, to measure the degree of pointedness of the cone K. Although several important examples are discussed to illustrate the theory in action, the emphasis of this work lies in the general properties that can be derived directly from the axiomatic model.

Resumo em Inglês:

This paper solves the problem of forecasting the number of trees in the selection stands predicted for harvesting in a future period, so that the main resource of the number of trees is sustained. This is achieved by stochastic modeling of the number of felled trees and by solving the certain partial differential equation.

Resumo em Inglês:

We discuss a globalization scheme for a class of active-set Newton methods for solving the mixed complementarity problem (MCP), which was proposed by the authors in [3]. The attractive features of the local phase of the method are that it requires solving only one system of linear equations per iteration, yet the local superlinear convergence is guaranteed under extremely mild assumptions, in particular weaker than the property of semistability of an MCP solution. Thus the local superlinear convergence conditions of the method are weaker than conditions required for the semismooth (generalized) Newton methods and also weaker than convergence conditions of the linearization (Josephy-Newton) method. Numerical experiments on some test problems are presented, including results on the MCPLIB collection for the globalized version.