Abstract
Subresultant chains over rings of multivariate polynomials are calculated using a speculative approach based on the Bézout matrix. Our experimental results yield significant speedup factors for the proposed approach against comparable methods. The determinant computations are based on fraction-free Gaussian elimination using various pivoting strategies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdeljaoued, J., Diaz-Toca, G.M., Gonzalez-Vega, L.: Minors of Bézout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor. Int. J. Comput. Math. 81(10), 1223–1238 (2004)
Abdeljaoued, J., Diaz-Toca, G.M., González-Vega, L.: Bézout matrices, subresultant polynomials and parameters. Appl. Math. Comput. 214(2), 588–594 (2009)
Asadi, M., et al.: Basic Polynomial Algebra Subprograms (BPAS) (2021). http://www.bpaslib.org
Asadi, M., Brandt, A., Moir, R.H.C., Moreno Maza, M., Xie, Y.: Parallelization of triangular decompositions: techniques and implementation. J. Symb. Comput. (2021, to appear)
Asadi, M., Brandt, A., Moreno Maza, M.: Computational schemes for subresultant chains. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2021. LNCS, vol. 12865, pp. 21–41. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85165-1_3
Bareiss, E.H.: Sylvester’s identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22(103), 565–578 (1968)
Bini, D., Pan, V.Y.: Polynomial and Matrix Computations: Fundamental Algorithms. Springer, New York (2012). https://doi.org/10.1007/978-1-4612-0265-3
Chen, C., Moreno Maza, M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610–642 (2012)
Diaz-Toca, G.M., Gonzalez-Vega, L.: Various new expressions for subresultants and their applications. Appl. Algebra Eng. Commun. Comput. 15(3–4), 233–266 (2004). https://doi.org/10.1007/s00200-004-0158-4
Ducos, L.: Optimizations of the subresultant algorithm. J. Pure Appl. Algebra 145(2), 149–163 (2000)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, Cambridge (2013)
Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Springer, New York (1992). https://doi.org/10.1007/b102438
Hou, X., Wang, D.: Subresultants with the Bézout matrix. In: Computer Mathematics, pp. 19–28. World Scientific (2000)
Jeffrey, D.J.: LU factoring of non-invertible matrices. ACM Commun. Comput. Algebra 44(1/2), 1–8 (2010)
Kerber, M.: Division-free computation of subresultants using Bézout matrices. Int. J. Comput. Math. 86(12), 2186–2200 (2009)
Lemaire, F., Moreno Maza, M., Xie, Y.: The RegularChains library in Maple. ACM SIGSAM Bull. 39(3), 96–97 (2005)
Li, Y.B.: A new approach for constructing subresultants. Appl. Math. Comput. 183(1), 471–476 (2006)
Olver, P.J., Shakiban, C.: Applied Linear Algebra. Prentice Hall, Upper Saddle River (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Asadi, M., Brandt, A., Jeffrey, D.J., Maza, M.M. (2022). Subresultant Chains Using Bézout Matrices. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2022. Lecture Notes in Computer Science, vol 13366. Springer, Cham. https://doi.org/10.1007/978-3-031-14788-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-14788-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-14787-6
Online ISBN: 978-3-031-14788-3
eBook Packages: Computer ScienceComputer Science (R0)