Abstract
With the introduction of VLSI (Very Large Scale Integration) technology [16], it has been possible for the first time to construct integrated circuits with as many as a million elements on a chip (in an area of approximately 1 cm2). The high degree of parallelism that can be achieved in circuits of such density enables computations to be realized on VLSI chips with extreme speed and efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bilardi, G. and Sarrafzadeh, M.: ‘Optimal discrete Fourier Transform in VLSI’, in International Workshop on Parallel Computing and VLSI, Amalfi, 1984.
Buzbee, B. L. and Dorr, F. W.: ‘The direct solution of the biharmonic equation on rectangular region and the Poisson equation on irregular regions’, SIAM J. Numer. Anal. 11 (1974) 753–762.
Cannon, J. R. and Morandi Cecchi, M.: ‘Numerical experiments on the solution of some biharmonic problems by mathematical programming techniques’,.9 IA AI J. Numer. Anal. 4 (1967) 147–154.
Chen, S. C. and Kuck, D. J.: ‘Time and parallel processor bounds for linear recurrence systems’, IEEE Trans. Comp. C-24 (1975) 701–717.
Codenotti, B., Lotti, G. and Romani, F.: ‘VLSI implementation of fast solvers for hand linear systems with constant. coefficient matrix’, Inf. Processing Lett. 21 (1985) 159–163.
Codenotti, B. and Lotti, G.: ‘A VLSI fast solvers for tridiagonal linear systems’, Inf. Processing Lett. 23 (1986) 111–1l4.
Ehrlich, L. W.: `Solving the biharmonic equation as coupled finite difference equations’, SIAM J. Numer. Anal. 8 (1971) 278–287.
Ehrlich, L. W. and Gupta, M. M.: ‘Some difference schemes for the biharmonic equation’, SIAM J. Numer. Anal. 12 (1975) 773–790.
Fadeev, D. K. and Fa.deeva, V. N.: Numerical Methods in Linear Algebra (in Russian), Fizmatgiz, Moscow, 1963.
Favati, P., Lotti, G. and Romani, F.: ‘VLSI implementation of the capacitance matrix method’, Integration 11 (1991) 3–9.
Golub, G. H.: `An algorithm for the discrete biharmonic equation’ (personal communication).
Hackbusch, W. and Trottenberg, U. (eds): Multigrid Methods, Lecture Notes in Mathematics 960, Springer-Verlag, Berlin, 1982.
Kung, II. T. and Leiserson, C. E.: ‘Systolic arrays for VLSI’, in Sparse Matrix Symp. Proc., Knoxville, 1978, pp. 256–282.
Leighton, F. T.: ‘New lower bound techniques for VLSI’, Proc. 22nd Annual IEEE Symp. Found. Comp. Sci., Nashville, 1981, pp. 1–12.
Lotti, G. and Vajteric, M.: ‘The application of VLSI Poisson solvers to the biharmonic problem’, Parallel Computing 18 (1992) 11–19.
Mead, C. and Conway, L.: Introduction to VLSI Systems, Addison-Wesley, Reading, 1980.
Miklosko,.1., Klette, R., Vajtersic, M. and Vrt’o, I.: Fast Algorithms and their Implementation on Specialized Parallel Computers, North-Volland, Amsterdam; Veda, Bratislava, 1988.
Morandi Cecchi, M. and Redivo Zaglia, M.: ‘Mathematical programming techniques to solve the biharmonic problem by a recursive projection algorithm’, J. C’oznp.:lppl. Math. 32 (1990) 191–201.
Proskurowski, W. and Widlund, O.: ‘On the numerical solution of Helmholtz’s equation by the capacitance matrix method’, Math. Comput. 30 (1976) 433–468.
Samarskii, A. A. and Nikolaev, J. S.: Methods for the Solution of Equations on Grids (in Russian), Nauka, Moscow, 1978.
Sameh, A. H., Chen, S. C. and Kuck, D. J.: ‘Parallel Poisson and biharmonic solvers’, Computing 17 (1976) 219–230.
Stone, H. S.: ‘Parallel tridiagonal equation solver’, ACM Trans. Math. Software 1 (1975) 289–307.
Thompson, C. D.: ‘Area-time complexity for VLSI’, PhD. Thesis, Carnegie-Mellon University, Pittsburgh, 1980.
Thompson, C. D.: ‘Fourier transform in VLSI’, Tech. Rep., University of California, Berkeley, 1982.
Ullman, J. D.: Computational Aspects of VLSI, Computer Science Press, Rockville, Md., 1984.
Vajtersic, M.: ‘A fast algorithm for solving the first biharmonic boundary value problem’, Computing 23 (1979) 171–178.
Vajtersic, M.: ‘Parallel marching Poisson solvers’, Parallel Computing 1 (1984) 325–330.
Vajtersic, M.: ‘VLSI implementation of a fast Poisson solver’, in Proc. CONPAR 88, Cambridge University Press, Cambridge, 1989, pp. 695–702.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Marián Vajteršic
About this chapter
Cite this chapter
Vajteršic, M. (1993). VLSI elliptic solvers. In: Algorithms for Elliptic Problems. Mathematics and Its Applications (East European Series), vol 58. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0701-5_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-0701-5_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4190-6
Online ISBN: 978-94-017-0701-5
eBook Packages: Springer Book Archive