Skip header Section
Skip Bibliometrics Section
Rounding Errors in Algebraic ProcessesJune 1994
- Author:
- James H. Wilkinson
Abstract
No abstract available.
Cited By
Mohammadisiahroudi M, Wu Z, Augustino B, Carr A and Terlaky T (2025). Improvements to Quantum Interior Point Method for Linear Optimization, ACM Transactions on Quantum Computing, 6:1, (1-24), Online publication date: 31-Mar-2025.- Cao Z, Sun Q, Yang W, Song C, Wang Z and Li H (2024). A novel HPL-AI approach for FP16-only accelerator and its instantiation on Kunpeng+Ascend AI-specific platform, Journal of Parallel and Distributed Computing, 190:C, Online publication date: 1-Aug-2024.
- Rump S and Ogita T (2024). On a quality measure for interval inclusions, BIT, 64:2, Online publication date: 1-Jun-2024.
- van Dinten I, Derakhshanfar P, Panichella A and Zaidman A (2024). The slow and the furious? Performance antipattern detection in Cyber–Physical Systems, Journal of Systems and Software, 210:C, Online publication date: 1-Apr-2024.
- Song L, Chen F, Li H and Chen Y ReFloat: Low-Cost Floating-Point Processing in ReRAM for Accelerating Iterative Linear Solvers Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-15)
- Lu H, Sao P, Matheson M, Kannan R, Wang F and Potok T Optimizing Communication in 2D Grid-Based MPI Applications at Exascale Proceedings of the 30th European MPI Users' Group Meeting, (1-11)
- Kotyra B and Chabudziński Ł (2023). Fast parallel algorithms for finding the longest flow paths in flow direction grids, Environmental Modelling & Software, 167:C, Online publication date: 1-Sep-2023.
- Qiao Y, Lan Q, Wang Y, Jia S, Kuang X, Yang Z and Ma C (2023). PEvaChain, Expert Systems with Applications: An International Journal, 223:C, Online publication date: 1-Aug-2023.
- Fasi M and Mikaitis M (2023). CPFloat: A C Library for Simulating Low-precision Arithmetic, ACM Transactions on Mathematical Software, 49:2, (1-32), Online publication date: 30-Jun-2023.
- Amestoy P, Buttari A, Higham N, L’Excellent J, Mary T and Vieublé B (2023). Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement, ACM Transactions on Mathematical Software, 49:1, (1-29), Online publication date: 31-Mar-2023.
- Lu H, Matheson M, Oles V, Ellis A, Joubert W and Wang F Climbing the summit and pushing the frontier of mixed precision benchmarks at extreme scale Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-15)
- Dmitruk B and Stpiczyński P Parallel Vectorized Implementations of Compensated Summation Algorithms Parallel Processing and Applied Mathematics, (63-74)
- Huang Y, Hao W and Lin G (2022). HomPINNs, Computers & Mathematics with Applications, 121:C, (62-73), Online publication date: 1-Sep-2022.
- Crum J, Cheng C, Ham D, Mitchell L, Kirby R, Levine J and Gillette A (2022). Bringing Trimmed Serendipity Methods to Computational Practice in Firedrake, ACM Transactions on Mathematical Software, 48:1, (1-19), Online publication date: 31-Mar-2022.
- Sheng Z and Ni Q (2021). Computing tensor Z-eigenvalues via shifted inverse power method, Journal of Computational and Applied Mathematics, 398:C, Online publication date: 15-Dec-2021.
- Barabasz B, Anderson A, Soodhalter K and Gregg D (2020). Error Analysis and Improving the Accuracy of Winograd Convolution for Deep Neural Networks, ACM Transactions on Mathematical Software, 46:4, (1-33), Online publication date: 31-Dec-2021.
- Rouhani B, Lo D, Zhao R, Liu M, Fowers J, Ovtcharov K, Vinogradsky A, Massengill S, Yang L, Bittner R, Forin A, Zhu H, Na T, Patel P, Che S, Koppaka L, Song X, Som S, Das K, Tiwary S, Reinhardt S, Lanka S, Chung E and Burger D Pushing the limits of narrow precision inferencing at cloud scale with microsoft floating point Proceedings of the 34th International Conference on Neural Information Processing Systems, (10271-10281)
- Grzymkowski Ł, Trofimowicz D and Stefański T (2020). Stability analysis of interconnected discrete-time fractional-order LTI state-space systems, International Journal of Applied Mathematics and Computer Science, 30:4, (649-658), Online publication date: 1-Dec-2020.
- Mascagni M, Neuman B, Dubois A, Monroe L and Robey R (2020). Fast, good, and repeatable, International Journal of High Performance Computing Applications, 34:5, (519-531), Online publication date: 1-Sep-2020.
- Fika P, Mitrouli M, Roupa P and Triantafyllou D (2020). The e-MoM approach for approximating matrix functionals, Journal of Computational and Applied Mathematics, 373:C, Online publication date: 1-Aug-2020.
- Ben-Nun T and Hoefler T (2019). Demystifying Parallel and Distributed Deep Learning, ACM Computing Surveys, 52:4, (1-43), Online publication date: 31-Jul-2020.
- Prikopa K and Gansterer W (2020). Fault-tolerant least squares solvers for wireless sensor networks based on gossiping, Journal of Parallel and Distributed Computing, 136:C, (52-62), Online publication date: 1-Feb-2020.
- Cools S, Cornelis J and Vanroose W (2019). Numerically Stable Recurrence Relations for the Communication Hiding Pipelined Conjugate Gradient Method, IEEE Transactions on Parallel and Distributed Systems, 30:11, (2507-2522), Online publication date: 1-Nov-2019.
- Proinov P and Ivanov S (2019). Convergence analysis of Sakurai–Torii–Sugiura iterative method for simultaneous approximation of polynomial zeros, Journal of Computational and Applied Mathematics, 357:C, (56-70), Online publication date: 1-Sep-2019.
- Sigalotti L, Rendón O, Klapp J, Vargas C and Cruz F (2019). A new insight into the consistency of the SPH interpolation formula, Applied Mathematics and Computation, 356:C, (50-73), Online publication date: 1-Sep-2019.
- Fika P and Mitrouli M (2019). Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications, Journal of Computational and Applied Mathematics, 355:C, (91-105), Online publication date: 1-Aug-2019.
- Wang X, Wang H, Su Z, Tang E, Chen X, Shen W, Chen Z, Wang L, Zhang X and Li X Global optimization of numerical programs via prioritized stochastic algebraic transformations Proceedings of the 41st International Conference on Software Engineering, (1131-1141)
- Fowers J, Ovtcharov K, Papamichael M, Massengill T, Liu M, Lo D, Alkalay S, Haselman M, Adams L, Ghandi M, Heil S, Patel P, Sapek A, Weisz G, Woods L, Lanka S, Reinhardt S, Caulfield A, Chung E and Burger D (2019). Inside Project Brainwave's Cloud-Scale, Real-Time AI Processor, IEEE Micro, 39:3, (20-28), Online publication date: 1-May-2019.
- Haidar A, Tomov S, Dongarra J and Higham N Harnessing GPU tensor cores for fast FP16 arithmetic to speed up mixed-precision iterative refinement solvers Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, (1-11)
- Dölz J and Harbrecht H (2018). Hierarchical matrix approximation for the uncertainty quantification of potentials on random domains, Journal of Computational Physics, 371:C, (506-527), Online publication date: 15-Oct-2018.
- Fraser N, Lee J, Moss D, Faraone J, Tridgell S, Jin C and Leong P (2017). FPGA Implementations of Kernel Normalised Least Mean Squares Processors, ACM Transactions on Reconfigurable Technology and Systems, 10:4, (1-20), Online publication date: 27-Dec-2017.
- Santos F and Rech P Analyzing the criticality of transient faults-induced SDCS on GPU applications Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, (1-7)
- Krisper M, Iber J, Rauter T and Kreiner C Physical Quantity Proceedings of the 22nd European Conference on Pattern Languages of Programs, (1-20)
- Adib M (2016). A $$Krylov$$Krylov subspace generalization of the improved $$Wilkinson$$Wilkinson's algorithm for ill-conditioned linear systems, Calcolo: a quarterly on numerical analysis and theory of computation, 53:1, (51-58), Online publication date: 1-Mar-2016.
- Patrinos P, Guiggiani A and Bemporad A (2015). A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic, Automatica (Journal of IFAC), 55:C, (226-235), Online publication date: 1-May-2015.
- Frechtling M and Leong P (2015). MCALIB, ACM Transactions on Programming Languages and Systems, 37:2, (1-25), Online publication date: 16-Apr-2015.
- Wang H (2014). Defending continuous collision detection against errors, ACM Transactions on Graphics, 33:4, (1-10), Online publication date: 27-Jul-2014.
- Jia Y, Bosilca G, Luszczek P and Dongarra J Parallel reduction to hessenberg form with algorithm-based fault tolerance Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-11)
- Gleixner A, Steffy D and Wolter K Improving the accuracy of linear programming solvers with iterative refinement Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, (187-194)
- Saunders B, Wood D and Youse B Numeric-symbolic exact rational linear system solver Proceedings of the 36th international symposium on Symbolic and algebraic computation, (305-312)
- Tang E, Barr E, Li X and Su Z Perturbing numerical calculations for statistical analysis of floating-point program (in)stability Proceedings of the 19th international symposium on Software testing and analysis, (131-142)
- Bressan M and Peserico E (2010). Choose the damping, choose the ranking?, Journal of Discrete Algorithms, 8:2, (199-213), Online publication date: 1-Jun-2010.
- Bekas C, Curioni A and Fedulova I Low cost high performance uncertainty quantification Proceedings of the 2nd Workshop on High Performance Computational Finance, (1-8)
- Frayssé V, Giraud L and Gratton S (2008). Algorithm 881, ACM Transactions on Mathematical Software, 35:2, (1-12), Online publication date: 25-Jul-2008.
- Buttari A, Dongarra J, Langou J, Langou J, Luszczek P and Kurzak J (2007). Mixed Precision Iterative Refinement Techniques for the Solution of Dense Linear Systems, International Journal of High Performance Computing Applications, 21:4, (457-466), Online publication date: 1-Nov-2007.
- Osada N (2007). A one parameter family of locally quartically convergent zero-finding methods, Journal of Computational and Applied Mathematics, 205:1, (116-128), Online publication date: 1-Aug-2007.
- Mainar E and Peòa J (2006). Evaluation algorithms for multivariate polynomials in Bernstein--Bézier form, Journal of Approximation Theory, 143:1, (44-61), Online publication date: 1-Nov-2006.
- Giesbrecht M, Labahn G and Lee W Symbolic-numeric sparse interpolation of multivariate polynomials Proceedings of the 2006 international symposium on Symbolic and algebraic computation, (116-123)
- Cheung D and Cucker F (2006). Solving linear programs with finite precision, Journal of Complexity, 22:3, (305-335), Online publication date: 1-Jun-2006.
- Graillat S and Langlois P Pseudozero set of interval polynomials Proceedings of the 2006 ACM symposium on Applied computing, (1655-1659)
- Barrio R and Peña J (2005). Evaluation of the derivative of a polynomial in Bernstein form, Applied Mathematics and Computation, 167:1, (125-142), Online publication date: 1-Aug-2005.
- Hoffmann C, Park G, Simard J and Stewart N Residual iteration and accurate polynomial evaluation for shape-interrogation applications Proceedings of the ninth ACM symposium on Solid modeling and applications, (9-14)
- van der Mark P, Wolters L and Cats G Using semi-lagrangian formulations with automatic code generation for environmental modeling Proceedings of the 2004 ACM symposium on Applied computing, (229-234)
- McNamee J (2004). A comparison of methods for accurate summation, ACM SIGSAM Bulletin, 38:1, (1-7), Online publication date: 1-Mar-2004.
- Nievergelt Y (2003). Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit, ACM Transactions on Mathematical Software, 29:1, (27-48), Online publication date: 1-Mar-2003.
- Stevenson D (2002). The Michelson-Morley Experiment, Computing in Science and Engineering, 4:6, (40-51), Online publication date: 1-Nov-2002.
- Cucker F (2002). Real Computations with Fake Numbers, Journal of Complexity, 18:1, (104-134), Online publication date: 1-Mar-2002.
- Harrison J (2000). Floating Point Verification in HOL Light, Formal Methods in System Design, 16:3, (271-305), Online publication date: 1-Jun-2000.
- Luo Z and Martonosi M (2000). Accelerating Pipelined Integer and Floating-Point Accumulations in Configurable Hardware with Delayed Addition Techniques, IEEE Transactions on Computers, 49:3, (208-218), Online publication date: 1-Mar-2000.
- Moore J, Lynch T and Kaufmann M (1998). A Mechanically Checked Proof of the AMD5K86TM Floating-Point Division Program, IEEE Transactions on Computers, 47:9, (913-926), Online publication date: 1-Sep-1998.
- Linial N, Samorodnitsky A and Wigderson A A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Proceedings of the thirtieth annual ACM symposium on Theory of computing, (644-652)
- Johnson J and Krandick W Polynomial real root isolation using approximate arithmetic Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (225-232)
- Dutt S and Assaad F (1996). Mantissa-Preserving Operations and Robust Algorithm-Based Fault Tolerance for Matrix Computations, IEEE Transactions on Computers, 45:4, (408-424), Online publication date: 1-Apr-1996.
- Stevenson D (1994). Science, computational science, and computer science, Communications of the ACM, 37:12, (85-96), Online publication date: 1-Dec-1994.
- Chen T and Luk W (1994). Aberth's method for the parallel iterative finding of polynomial zeros, ACM SIGAPL APL Quote Quad, 25:1, (40-49), Online publication date: 1-Oct-1994.
- Chen T and Luk W Aberth's method for the parallel iterative finding of polynomial zeros Proceedings of the international conference on APL : the language and its applications: the language and its applications, (40-49)
- Stevenson D Science, computational science, and computer science Proceedings of the 1993 ACM conference on Computer science, (7-14)
- Ziv A (1991). Fast evaluation of elementary mathematical functions with correctly rounded last bit, ACM Transactions on Mathematical Software, 17:3, (410-423), Online publication date: 1-Sep-1991.
- Manocha D and Canny J A new approach for surface intersection Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, (209-219)
- Dunham C (1990). How accurate should numerical routines be?, ACM SIGNUM Newsletter, 25:2, (8-9), Online publication date: 1-Jul-1990.
- Knuth D, Motwani R and Pittel B Stable husbands Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, (397-404)
- Payne M, Schaffert C and Wichmann B (1990). Proposal for a language compatible arithmetic standard, ACM SIGNUM Newsletter, 25:1, (2-43), Online publication date: 1-Jan-1990.
- Dunham C (1989). Improvement of complex arithmetic by use of double elements, ACM SIGNUM Newsletter, 24:4, (3-7), Online publication date: 1-Nov-1989.
- Char B Automatic reasoning about numerical stability of rational expressions Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, (234-241)
- Macleod A (1989). Some statistics on Gaussian elimination with partial pivoting, ACM SIGNUM Newsletter, 24:2-3, (10-14), Online publication date: 1-Apr-1989.
- Dunham C (1989). Perturbation analysis of Horner's method for nice cases, ACM SIGNUM Newsletter, 24:2-3, (8-9), Online publication date: 1-Apr-1989.
- Dobkin D and Silver D Recipes for geometry and numerical analysis - Part I: an empirical study Proceedings of the fourth annual symposium on Computational geometry, (93-105)
- Dunham C (1987). Provably monotone approximations, ACM SIGNUM Newsletter, 22:2, (6-11), Online publication date: 1-Apr-1987.
- Dunham C (1986). Test for (IN) equality, subtraction, proof of correctness, ACM SIGNUM Newsletter, 21:3, (27-30), Online publication date: 1-Jul-1986.
- Hammarling S (1985). The singular value decomposition in multivariate statistics, ACM SIGNUM Newsletter, 20:3, (2-25), Online publication date: 1-Jul-1985.
- Molchanov I, Zubatenko V, Nikolenko L and Yakovlev M (1984). A program complex for solving systems of linear algebraic equations, ACM Transactions on Mathematical Software, 10:3, (231-241), Online publication date: 28-Aug-1984.
- Kuki H and Cody W (1983). A statistical study of the accuracy of floating point number systems, Communications of the ACM, 26:1, (79-83), Online publication date: 1-Jan-1983.
- Linnainmaa S (1981). Combatting the effects of underflow and overflow in determining real roots of polynomials, ACM SIGNUM Newsletter, 16:2, (11-16), Online publication date: 1-Jun-1981.
- Francis M (1981). Error control in the numerical inversion of the eigenvector matrix, ACM SIGNUM Newsletter, 16:1, (26-26), Online publication date: 1-Mar-1981.
- Cody W (1980). Software basics for computational mathematics, ACM SIGNUM Newsletter, 15:2, (18-29), Online publication date: 1-Jun-1980.
- Chan T and Lewis J (1979). Computing standard deviations, Communications of the ACM, 22:9, (526-531), Online publication date: 1-Sep-1979.
- Feldman S (1979). Comments on the IFIP working group 2.5 proposal on "parameterization of the environment for transportable numerical software", ACM SIGNUM Newsletter, 14:2, (18-20), Online publication date: 1-Jun-1979.
- Brown W and Feldman S (1978). Environment parameters and basic functions for floating-point computation, ACM SIGNUM Newsletter, 14:1, (42-45), Online publication date: 1-Mar-1979.
- Reinsch C (1979). Principles and preferences for computer arithmetic, ACM SIGNUM Newsletter, 14:1, (12-27), Online publication date: 1-Mar-1979.
- Brown W and Feldman S Environment parameters and basic functions for floating-point computation Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software, (42-45)
- Yuen C (1975). On the Floating Point Representation of Complex Numbers, IEEE Transactions on Computers, 24:8, (846-848), Online publication date: 1-Aug-1975.
- Dubrulle A APL functions for precision control in floating-point computations Proceedings of seventh international conference on APL, (101-104)
- Evans D (1975). Problem formulation using array processing techniques, ACM SIGPLAN Notices, 10:3, (153-163), Online publication date: 1-Mar-1975.
- Evans D Problem formulation using array processing techniques Proceedings of the conference on Programming languages and compilers for parallel and vector machines, (153-163)
- Peters G and Wilkinson J (1975). On the stability of Gauss-Jordan elimination with pivoting, Communications of the ACM, 18:1, (20-24), Online publication date: 1-Jan-1975.
- Tsao N (1974). On the distributions of significant digits and roundoff errors, Communications of the ACM, 17:5, (269-271), Online publication date: 1-May-1974.
- Miller W Computational complexity and numerical stability Proceedings of the sixth annual ACM symposium on Theory of computing, (317-322)
- Malcolm M and Palmer J (1974). A fast method for solving a class of tridiagonal linear systems, Communications of the ACM, 17:1, (14-17), Online publication date: 1-Jan-1974.
- Reddaway S (1973). DAP—a distributed array processor, ACM SIGARCH Computer Architecture News, 2:4, (61-65), Online publication date: 17-Dec-1973.
- Reddaway S DAP—a distributed array processor Proceedings of the 1st annual symposium on Computer architecture, (61-65)
- Miller W Toward mechanical verification of properties of roundoff error propagation Proceedings of the fifth annual ACM symposium on Theory of computing, (50-58)
- Kuki H and Cody W (1973). A statistical study of the accuracy of floating point number systems, Communications of the ACM, 16:4, (223-230), Online publication date: 1-Apr-1973.
- Rokne J (1973). Automatic errorbounds for simple zeros of analytic functions, Communications of the ACM, 16:2, (101-104), Online publication date: 1-Feb-1973.
- Richman P (1973). Variable-precision exponentiation, Communications of the ACM, 16:1, (38-40), Online publication date: 1-Jan-1973.
- Richman P (1972). Automatic error analysis for determining precision, Communications of the ACM, 15:9, (813-817), Online publication date: 1-Sep-1972.
- Dunaway D and Turlington B Some major modifications to a new method for solving ill-conditioned polynomial equations Proceedings of the ACM annual conference - Volume 2, (636-643)
- Traub J (1972). Numerical mathematics and computer science, Communications of the ACM, 15:7, (537-541), Online publication date: 1-Jul-1972.
- Ramamoorthy C and Tsuchiya M Microprogrammed significance arithmetic Proceedings of the May 16-18, 1972, spring joint computer conference, (659-673)
- Gustafson S (1971). Rapid computation of general interpolation formulas and mechanical quadrature rules, Communications of the ACM, 14:12, (797-801), Online publication date: 1-Dec-1971.
- Malcolm M (1971). On accurate floating-point summation, Communications of the ACM, 14:11, (731-736), Online publication date: 1-Nov-1971.
- Bosarge W and Johnson O (1971). Numerical properties of the Ritz-Trefftz algorithm for optimal control, Communications of the ACM, 14:6, (402-406), Online publication date: 1-Jun-1971.
- Bright H, Colhoun B and Mallory F A software system for tracing numerical significance during computer program execution Proceedings of the May 18-20, 1971, spring joint computer conference, (387-391)
- Puccinelli E Improving iterative improvement Proceedings of the 1971 26th annual conference, (736-744)
- Ehrlich L (1970). Complex matrix inversion versus real, Communications of the ACM, 13:9, (561-562), Online publication date: 1-Sep-1970.
- Nievergelt J (1970). Syllabus for low level performance for the qualifying examination in computer science, ACM SIGCSE Bulletin, 2:2, (43-53), Online publication date: 1-Jun-1970.
- Linz P (1970). Accurate floating-point summation, Communications of the ACM, 13:6, (361-362), Online publication date: 1-Jun-1970.
- Hansen E (1970). Repeated additions, ACM SIGNUM Newsletter, 5:1, (11-12), Online publication date: 1-Mar-1970.
- Brown W and Richman P (1969). The choice of base, Communications of the ACM, 12:10, (560-561), Online publication date: 1-Oct-1969.
- Hanson R (1969). Certifying linear equation solvers, ACM SIGNUM Newsletter, 4:3, (21-29), Online publication date: 1-Oct-1969.
- Johnson O Optimal n-line Successive Over Relaxation Proceedings of the 1969 24th national conference, (173-177)
- Morris W (1969). On counting n-ary compositions, ACM SIGNUM Newsletter, 4:2, (7-8), Online publication date: 1-Jun-1969.
- Metzger R Computer generated graphic segments in a raster display Proceedings of the May 14-16, 1969, spring joint computer conference, (161-172)
- Bartels R and Golub G (1969). The simplex method of linear programming using LU decomposition, Communications of the ACM, 12:5, (266-268), Online publication date: 1-May-1969.
- Bartels R and Golub G (1968). Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations, Communications of the ACM, 11:6, (401-406), Online publication date: 1-Jun-1968.
- Atchison W, Conte S, Hamblen J, Hull T, Keenan T, Kehl W, McCluskey E, Navarro S, Rheinboldt W, Schweppe E, Viavant W and Young D (1968). Curriculum 68: Recommendations for academic programs in computer science, Communications of the ACM, 11:3, (151-197), Online publication date: 1-Mar-1968.
- Adams D (1967). A stopping criterion for polynomial root finding, Communications of the ACM, 10:10, (655-658), Online publication date: 1-Oct-1967.
- Moler C Accurate solution of linear algebraic systems Proceedings of the April 18-20, 1967, spring joint computer conference, (321-324)
- Ehrlich L (1967). A modified Newton method for polynomials, Communications of the ACM, 10:2, (107-108), Online publication date: 1-Feb-1967.
- Bingham J (1967). An improvement to iterative methods of polynomial factorization, Communications of the ACM, 10:1, (57-60), Online publication date: 1-Jan-1967.
- Forsythe G (1967). A university's educational program in computer science, Communications of the ACM, 10:1, (3-11), Online publication date: 1-Jan-1967.
- Gentleman W and Sande G Fast Fourier Transforms Proceedings of the November 7-10, 1966, fall joint computer conference, (563-578)
- Tobey R (1966). Eliminating monotonous mathematics with FORMAC, Communications of the ACM, 9:10, (742-751), Online publication date: 1-Oct-1966.
- Ehrlich L Iterative vs. a directive method for solving fourth order elliptic difference equations Proceedings of the 1966 21st national conference, (29-35)
- Conte S, Hamblen J, Kehl W, Navarro S, Rheinboldt W, Young D and Atchinson W (1965). An undergraduate program in computer science—preliminary recommendations, Communications of the ACM, 8:9, (543-552), Online publication date: 1-Sep-1965.
- Grau A (1965). Algorithm 256: modified Graeffe method [C2], Communications of the ACM, 8:6, (379-380), Online publication date: 1-Jun-1965.
- Forsythe G (1964). An undergraduate curriculum in numerical analysis, Communications of the ACM, 7:4, (214-215), Online publication date: 1-Apr-1964.
Index Terms
- Rounding Errors in Algebraic Processes
Recommendations
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information ...
Algebraic structures on double and plane posets
We study the Hopf algebra of double posets and two of its Hopf subalgebras, the Hopf algebras of plane posets and of posets "without N". We prove that they are free, cofree, self-dual, and we give an explicit Hopf pairing on these Hopf algebras. We also ...
An algebraic characterization of independence of Petri net processes
Special issue: Contribution to computing scienceThe paper is concerned with processes of Petri nets. A partial operation on such processes is defined that allows one to concatenate processes whenever one process is a continuation of another. It is shown that for any Petri net as defined in the paper ...