Search results for "Spline"

showing 10 items of 170 documents

Absolutely summing operators on C[0,1] as a tree space and the bounded approximation property

AbstractLet X be a Banach space. For describing the space P(C[0,1],X) of absolutely summing operators from C[0,1] to X in terms of the space X itself, we construct a tree space ℓ1tree(X) on X. It consists of special trees in X which we call two-trunk trees. We prove that P(C[0,1],X) is isometrically isomorphic to ℓ1tree(X). As an application, we characterize the bounded approximation property (BAP) and the weak BAP in terms of X∗-valued sequence spaces.

Banach spacesAbsolutely summing operatorsTwo-trunk treesContinuous functions on [01]Linear B-splinesBounded approximation propertiesJournal of Functional Analysis
researchProduct

Deconvolution by Regularized Matching Pursuit

2014

In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …

Blind deconvolutionSpline (mathematics)WaveletComputer scienceSpline waveletOblique projectionDeconvolutionGreedy algorithmMatching pursuitAlgorithm
researchProduct

Non-periodic Polynomial Splines

2015

In this chapter, we outline the essentials of the splines theory. By themselves, they are of interest for signal processing research. We use the Zak transform to derive an integral representation of polynomial splines on uniform grids. The integral representation facilitated design of different generators of spline spaces and their duals. It provides explicit expressions for interpolating and smoothing splines of any order. In forthcoming chapters, the integral representation of splines will be used for the constructions of efficient subdivision schemes and so also for the design spline-based wavelets and wavelet frames.

Box splineComputer scienceZak transformMathematicsofComputing_NUMERICALANALYSISMathematics::Numerical AnalysisMatrix polynomialAlgebraSpline (mathematics)Smoothing splineComputer Science::GraphicsWaveletDegree of a polynomialChebyshev nodesComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Special Splines of Exponential Type for the Solutions of Mass Transfer Problems in Multilayer Domains

2016

We consider averaging methods for solving the 3-D boundary-value problem of second order in multilayer domain. The special hyperbolic and exponential type splines, with middle integral values of piece-wise smooth function interpolation are considered. With the help of these splines the problems of mathematical physics in 3-D with piece-wise coefficients are reduced with respect to one coordinate to 2-D problems. This procedure also allows to reduce the 2-D problems to 1-D problems and the solution of the approximated problemsa can be obtained analytically. In the case of constant piece-wise coefficients we obtain the exact discrete approximation of a steady-state 1-D boundary-value problem.…

Box splineDiscretization3D problemMathematical analysisaveraging method010103 numerical & computational mathematicsSpace (mathematics)01 natural sciencesExponential type010101 applied mathematicsanalytical solutionAlternating direction implicit methodspecial splinesModeling and SimulationADI methodQA1-939Order (group theory)0101 mathematicsConstant (mathematics)AnalysisMathematicsMathematicsInterpolationMathematical Modelling and Analysis
researchProduct

A Geometric Algorithm for Ray/Bézier Surfaces Intersection Using Quasi-Interpolating Control Net

2008

In this paper, we present a new geometric algorithm to compute the intersection between a ray and a rectangular Bezier patch. The novelty of our approach resides in the use of bounds of the difference between a Bezier patch and its quasi-interpolating control net. The quasi-interpolating polygon of a Bezier surface of arbitrary degree approximates the limit surface within a precision that is function of the second order difference of the control points, which allows for very simple projections and 2D intersection tests to determine sub-patches containing a potential intersection. Our algorithm is simple, because it only determines a 2D parametric interval containing the solution, and effici…

Bézier surfaceStatistical classificationSpline (mathematics)Computer Science::GraphicsComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONBasis functionAlgorithm designBézier curveAlgorithmComputingMethodologies_COMPUTERGRAPHICSInterpolationMathematicsParametric statistics2008 IEEE International Conference on Signal Image Technology and Internet Based Systems
researchProduct

Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform

2018

The paper is devoted to an application of a modified F-transform technique based on B-splines in solving linear boundary value problems via the collocation method. An approximate solution is sought as a composite F-transform of a discrete function (which allows the solution to be compactly stored as the values of this discrete function). We demonstrate the effectiveness of the described technique with numerical examples, compare it with other methods and propose theoretical results on the order of approximation when the fuzzy partition is based on cubic B-splines.

CollocationB-spline010103 numerical & computational mathematics02 engineering and technologyFunction (mathematics)01 natural sciencesFuzzy logicCollocation method0202 electrical engineering electronic engineering information engineeringOrder (group theory)Applied mathematics020201 artificial intelligence & image processingBoundary value problem0101 mathematicsApproximate solutionMathematics
researchProduct

Calculation of Splines Values by Subdivision

2014

Assume, the samples of a spline \(S(t)\in {}^{p}\fancyscript{S}\) on the grid \(\mathbf{g} =\{k\}_{k\in \mathbb {Z}}\) are available: \(S(k)=y[k]\). Subdivision schemes are proposed to calculate the spline’s values at dyadic and triadic rational points \(S(k/2^m)\) and \(S(k/3^m)\). The SHA technique provides fast and explicit implementation of the subdivision for one- and two-dimensional periodic splines.

CombinatoricsSpline (mathematics)Computer Science::GraphicsBox splinebusiness.industrybusinessMathematicsSubdivision
researchProduct

Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field

2010

In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchronous, with good task balancing and requiring a small amount of data transfer.

ComputationNumerical analysisProcess (computing)MultiprocessingField (computer science)Computational scienceComputer Science ApplicationsSettore MAT/08 - Analisi NumericaOperator (computer programming)Parallel processing (DSP implementation)Modeling and SimulationModelling and SimulationImage velocity vectors field Quasi-interpolant operator B-spline functions Distributed multiprocessor systemsAlgorithmMathematicsData transmissionMathematical and Computer Modelling
researchProduct

A Spline Collocation Scheme for the Spherical Shallow Water Equations

1999

Computational MathematicsNumerical AnalysisPhysics and Astronomy (miscellaneous)Spline collocationApplied MathematicsModeling and SimulationScheme (mathematics)Method of linesMathematical analysisNumerical weather predictionShallow water equationsComputer Science ApplicationsMathematicsJournal of Computational Physics
researchProduct

Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III

1980

In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…

Computational MathematicsSpline (mathematics)Approximations of πApplied MathematicsNumerical analysisOrdinary differential equationMathematical analysisDivergence theoremInitial value problemDegree of a polynomialMathematicsNumerische Mathematik
researchProduct