Abstract
In this paper, we establish a relationship between preconditioning strategies for solving the linear systems behind a fitting surface problem using the Powell–Sabin finite element, and choosing appropriate basis of the spline vector space to which the fitting surface belongs. We study the problem of determining whether good (or effective) preconditioners lead to good basis and vice versa. A preconditioner is considered to be good if it either reduces the condition number of the preconditioned matrix or clusters its eigenvalues, and a basis is considered to be good if it has local support and constitutes a partition of unity. We present some illustrative numerical results which indicate that the basis associated to well-known good preconditioners do not have in general the expected good properties. Similarly, the preconditioners obtained from well-known good basis do not exhibit the expected good numerical properties. Nevertheless, taking advantage of the established relationship, we develop some adapted good preconditioning strategies which can be associated to good basis, and we also develop some adapted and not necessarily good basis that produce effective preconditioners.
Similar content being viewed by others
Notes
The problem can be solved using fmincon from the MATLAB® Optimization Toolbox or similar solver.
References
Addam M, Bouhamidi A, Jbilou K (2012) Signal reconstruction for the diffusion transport equation using tensorial spline Galerkin approximation. Appl Num Math 62(9):1089–1108
Barrera D, Fortes MA, González P, Pasadas M (2008) Minimal energy surfaces on Powell-Sabin type triangulations. Appl Num Math 58(5):635–645
Benzi M, Tůma M (2003) A robust incomplete factorization preconditioner for positive definite matrices. Num Linear Algebra Appl 10(5–6):385–400
Böhm W, Farin G, Kahmann J (1984) A survey of curve and surface methods in CAGD. Comput Aid Geom Des 1:1–60
Chen K (2005) Matrix preconditioning techniques and applications. Cambridge University Press, Cambridge
Davydov O, Nürnberger G, Zeilfelder F (1998) Approximation order of bivariate spline interpolation for arbitrary smoothness. J Comput Appl Math 90:117–134
Dierckx P, Van Leemput S, Vermeire T (1992) Algorithms for surface fitting using Powell–Sabin splines. IMA J Num Anal 12:271–299
Dierckx P (1997) On calculating normalized Powell–Sabin B-splines. Comput Aid Geom Des 15:61–78
Fortes MA, González P, Moncayo M, Pasadas M (2010) Multiresolution analysis for minimal energy \({C}^r\)-Surfaces on Powell-Sabin Type Meshes. Math Methods Curves Surf Lect Notes Comput Sci 5862:209–223
Fortes MA, Raydan M, Sajo-Castelli AM (2016) Inverse-free recursive multiresolution algorithms for a data approximation problem. Comput Math Appl 72:1177–1187
Fortes MA, González P, Palomares A, Pasadas M (2017) Filling holes with geometric and volumetric constraints. Comput Math Appl 74:671–683
Garach L, de Oña J, Pasadas M (2014) Determination of alignments in existing roads by using spline techniques. Math Comput Simul 102:144–152
Greiner G (1994) Surface construction based on variational principles, in wavelets, images and surface fitting. In: Laurent PJ, Le Méhauté A, Schumaker LL (eds) Wellesley, pp 277–286
Hao Y, Li C, Wang R (2018) Sparse approximate solution of fitting surface to scattered points by MLASSO model. Sci China Math 61:1319–1336
Izquierdo D, López de Silanes MC, Parra MC, Torrens JJ (2014) CS-RBF interpolation of surfaces with vertical faults from scattered data. Math Comput Simul 102:11–23
Katerinina SYu, Voronkova GV, Rekunov SS, Arzamaskova LM, Konovalov OV, Evdokimov EE (2018) Application of algorithm target change of the filled cells of the matrix for a one-dimensional bending element in the problems of structural mechanics. Adv Eng Res 177:558–562
Laghchim-Lahlou M, Sablonnière P (1996) \({\cal{C}}^r\)-finite elements of Powell-Sabin type on the three direction mesh. Adv Comput Math 6:191–206
Powell MJD, Sabin MA (1977) Piecewise quadratic approximations on triangles. ACM Trans Math Softw 3(4):316–325
Navarro Hermoso JL, Martínez Sanz N (2015) Receiver tube performance depending on cleaning methods. Energy Proc 69:1529–1539
Saad Y (2003) Iterative methods for sparse linear systems, 2\(^{nd}\) edition. SIAM, New York
Sablonnière P (1987) Error bounds for Hermite interpolation by quadratic splines on an \(\alpha \)-triangulation. IMA J Num Anal 7(4):495–508
Sajo-Castelli AM, Fortes MA, Raydan M (2014) Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell–Sabin triangulations. J Comput Appl Math 268:34–55
Sbibih D, Serghini A, Tijini A (2012) Normalized trivariate B-splines on Worsey–Piper split and quasi-interpolants. BIT Numer Math 52:221–249
Shi X, Wang S, Wang W, Wang RH (1986) The \({\cal{C}}^1\)-quadratic spline space on triangulations, Report 86004. Jilin University, Changchun, Department of Mathematics
Speleers H (2013) Multivariate normalized Powel–Sabin B-splines and quasi-interpolants. Comput Aided Geom Des 30:2–19
Ülker E, Arslan A (2009) Automatic knot adjustment using an artificial immune system for B-spline curve approximation. Inf Sci 179:1483–1494
Uyar K, Ülker E, Arslan A (2016) Int J Intell Syst Appl Eng 4:204–210
Acknowledgements
The second author was financially supported by the Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) through the project UIDB/MAT/00297/2020 (Centro de Matemática e Aplicações).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Jinyun Yuan.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fortes, M.A., Raydan, M. & Sajo-Castelli, A.M. Relationship between quality of basis for surface approximation and the effect of applying preconditioning strategies to their resulting linear systems. Comp. Appl. Math. 40, 41 (2021). https://doi.org/10.1007/s40314-021-01433-6
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-021-01433-6