default search action
International Journal of Computer Mathematics, Volume 70
Volume 70, Number 1, 1998
- Jin Yun Yuan, L. C. Matoli:
Asymptotically optimal row-action methods for generalized least squares problems. 1-18 - Chao Yang, Jianzhon Zhang:
A constrained capacity expansion problem on networks. 19-33 - George A. Gravvanis:
An approximate inverse matrix technique for arrowhead matrices. 35-45 - Hermineh Y. Y. Sanossian:
A comparative study for character recognition using neural networks. 47-55 - Loe M. G. Feijs, René L. Krikhaar:
Relation algebra with multi-relations. 57-74 - José Mario Martínez
:
Augmented lagrangians and sphere packing problems. 75-86 - Ashis K. Pani, G. P. Bhattacharjee, R. N. Mohapatra
Event scheduling using allen's algebra. 87-97 - Emanuele Galligani, Valeria Ruggiero, Luca Zanni
A minimization method for the solution of large symmetriric eigenproblems. 99-115 - Nejib Smaoui
Using chaos to shadow the quadratic map for all time. 117-129
Volume 70, Number 2, 1998
- Nikolaos M. Missirlis
The extrapolated ω-double jacobi (Eω-DOJ) method. 131-148 - Kamala Krithivasan, S. Jeyalakshmi:
Visibility of rectagular objects in L 1 metric. 149-163 - Tianzi Jiang:
A parallel information-based complexity approach to visual surface reconstruction. 165-177 - Bülent Karasözen, A. Y. Özban:
Modified iterative methods for linear systems of equations. 179-196 - Gabriel Dimitriu:
Numerical approximation of the optimal inputs for an identification problem. 197-209 - Jun Zou:
Numerical methods for elliptic inverse problems. 211-232 - David J. Evans, A. R. Yaakub:
Weighted fifth-order Runge-Kutta formulas for second-order differential equations. 233-239 - Mohsen Razzaghi, Masoud Shafiee
Optimal control of singular systems VIA legendre series. 241-250 - N. Ramanujam, Srinivasan Natesan
'Shooting method' for singular perturbation problems arising in chemical reactor theory. 251-262 - Yongzhong Song:
Error Bounds for some overrelaxation methods. 263-278 - Tanil Ergenç, Ali Ihsan Hasçelik:
Order of convergence of evolution operator method. 279-288 - Tang Jiankang:
On the convergence of the parallel multisplitting PSD algorithm. 289-296 - Etsuro Moriya, Keiko Tsugane:
Optimally fast shortest path algorithms for some classes of graphs. 297-317 - Ivan Stojmenovic, Antoine Zoghbi:
Fast algorithms for genegrating integer partitions. 319-332 - Ahmed Sharaf Eldin
Construction of skolem sequences. 333-345 - Muhammad Aslam Noor, Eisa A. Al-Said:
Numerical solutions of a system of fourth order boundary value problems. 347-355 - David J. Evans, Sevelyn Chikohora:
Convergence testing on a distributed network of processors. 357-378
Volume 70, Number 3, 1999
- S. A. Hussain, V. U. K. Sastry:
Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs. 383-391 - Goutam Sarker:
An automatic rule induction technique for learning expert systems. 393-401 - Tian Zhenfu:
A new method of constructing two-level four-point explicit difference schemes with higher stability properties. 403-410 - Suheil A. Khuri:
Biorthogonality condition for stokes flow in rectangular regions. 411-415 - Arindama Singh
Computing prime implicants via transversal clauses. 417-427 - M. M. Chawla, Mansour A. Al-Zanaidi, David J. Evans:
Generalized trapezoidal formulas for parabolic equations. 429-443 - B. P. Acharya, N. Mohanty:
Formulas for the numerical approximation of contour integrals. 445-451 - Mohd Salleh Sahimi, Elankovan Sundararajan
The iterative alternating decomposition explicit (iade) method to solve second order parabolic equations with periodic boundary conditions. 453-465 - A. Ayad:
Spline approximation for first Order fredholm delay integro-differential equations. 467-476 - K. Murugesan
Analysis of different second order systems via runge-kutta method. 477-493 - Ping-Sung Liao, Tse-Sheng Chen, Pau-Choo Chung:
A fast algorithm for computing transitive relation. 495-504 - Patrizio Frosini, Massimiliano Pittore
New methods for reducing size graphs. 505-517 - Zhong-Zhi Bai, David J. Evans:
Asynchronous multisplitting relaxation methods for linear complementarity problems. 519-538 - Qianshun Chang, Shuqing Ma, Guangyao Lei:
Algebraic multigrid method for queueing networks. 539-552 - H. S. Lee:
A fast algorithm for locating supplying center on a lattice. 553-569 - Whye-Teong Ang
A complex variable boundary element method for a class of boundary value problems in anisotropic thermoelasticity. 571-586
Volume 70, Number 4, 1999
- Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal:
An efficient algorithm to generate all maximal independent sets on trapezoid graphs. 587-599 - Erkki Mäkinen:
Inferring regular languages by merging nonterminals. 601-616 - David J. Evans, A. J. Kane:
Systolic neural algorithms. 617-647 - Olympia Louscou-Bozapalidou:
Some remarks on recognizable treeseries. 649-655 - Min-Shiang Hwang:
A remote password authentication scheme based on the digital signature method. 657-666 - J. E. Gómez, H. Power:
A parallel multipolar boundary element method for internal stokes flows. 667-697 - Yunbin Zhao, Jiye Han, Zengzhu Xu:
Iteration complexity of an interior-point algorithm for nonlinear p-complementarity problems. 699-715 - Eisa A. Al-Said:
Spline methods for solving system of second-order boundary-value problems. 717-727 - Shaohong Zhu, Guangwei Yuan, Longjun Shen:
A domain decomposition parallel scheme for the linear dispersive equation. 729-738 - Vittoria Demichelis:
Spline approximation with interpolation constraints for numerical integration. 739-750 - David J. Evans, N. I. Kadhum:
The spline alternating group explicit (splage) method for two dimensional problems. 751-771 - Chenglie Hu:
On the extended one-step schemes for solving stiff systems of ordinary differential equations. 773-788
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: