Calcolo
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Linear programming selection of internal financial laws and a knapsack problem
Calcolo - Tập 37 - Trang 47-57 - 2000
We formulate and solve explicitly a linear programming problem that arises from the problem of choosing an internal financial law of a given financial project such that the associated discount vector maximizes a linear objective function. If the original problem has optimal solutions, then it is equivalent to a knapsack problem. We obtain its basic optimal solutions in closed form. After consider......
Systematic construction of optimal linear recurrent codes for burst error correction
Calcolo - Tập 1 - Trang 147-153 - 1964
A method is presented for the construction of binary linear burst error correcting recurrent codes of type B2, viz. those codes which correct any burst of lengthl=rb or less provided it is confined amongr successive blocks of lengthb. The proposed codes are optimal in the sense they meet the lower bound obtained by Wyner and Ash, and are constructed through a particular bordering of the characteri......
Sulla stabilità dei metodi Pseudo Runge-Kutta
Calcolo - Tập 8 - Trang 293-300 - 1971
Si studia la stabilità dei metodi pseudo Runge-Kutta. Si confrontano gli intervalli di stabilità con gli analoghi metodi di Runge-Kutta e a differenze finite.
Sulla «Regolarizzazione» dei dati sperimentali
Calcolo - Tập 8 - Trang 359-376 - 1971
In questa nota si descrive un metodo numerico per risolvere il problema generalizzato della «regolarizzazione» dei dati sperimentali quando si usa il funzionale di Schoenberg e di Whittaker; inoltre si stabiliscono alcuni criteri per la determinazione dei «parametri di regolarizzazione». Questo metodo è particolarmente conveniente per risolvere numericamente le equazioni integrali lineari di Fredh......
The method of successive orthogonal projections for solving nonlinear simultaneous equations
Calcolo - Tập 23 - Trang 93-104 - 1986
In this paper we analyze a generalization of the method of Successive Orthogonal Projections (S.O.P.) for solving nonlinear simultaneous equations. We prove a local linear convergence theorem under mild assumptions on the Jacobian of the system. A globally convergent S.O.P. type method is also introduced. We comment some numerical experiences.
Problemi di “recovery” e loro soluzioni nei sistemi on-line real-time per la elaborazione dei dati
Calcolo - Tập 5 - Trang 401-408 - 1968
Prismatic mixed finite elements for second order elliptic problems
Calcolo - Tập 26 - Trang 135-148 - 1989
In this paper, three families of mixed finite elements based on prisms are introduced. These spaces are analogues to those based on simplices and cubes in three space variables. Error estimates in L2 and H−5 are given.
Interpolation and approximation of quasiseparable systems: the Schur-Takagi case
Calcolo - Tập 42 Số 3-4 - Trang 139-156 - 2005
A hybrid algorithm for queueing systems
Calcolo - Tập 41 - Trang 139-151 - 2004
In this paper, we propose a hybrid algorithm based on [12] for solving linear systems of equations. The hybrid algorithm combines the evolutionary algorithm and the successive over-relaxation (SOR) method. The evolutionary algorithm allows the relaxation parameter w to be adaptive in the SOR method. We prove the convergence of the hybrid algorithm for strictly diagonal dominant linear systems. We ......
On the generalized successive approximations method
Calcolo - Tập 25 - Trang 249-267 - 1988
In this paper, denoted a continuous function from [0,1]2 into [0,1] by f, we consider the iterative process:
$$f(y,x) = x \ne y = f(x,y),$$
, and we dealt with the question of global convergence of above iterative process, i.e. the question of convergence, for each point(x1,x0) of [0,1]2, of sequence ℕ o......
Tổng số: 1,081
- 1
- 2
- 3
- 4
- 5
- 6
- 10