標(biāo)題: Titlebook: Approximation Theory XV: San Antonio 2016; Gregory E. Fasshauer,Larry L. Schumaker Conference proceedings 2017 Springer International Publ [打印本頁] 作者: Intermediary 時間: 2025-3-21 18:44
書目名稱Approximation Theory XV: San Antonio 2016影響因子(影響力)
書目名稱Approximation Theory XV: San Antonio 2016影響因子(影響力)學(xué)科排名
書目名稱Approximation Theory XV: San Antonio 2016網(wǎng)絡(luò)公開度
書目名稱Approximation Theory XV: San Antonio 2016網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation Theory XV: San Antonio 2016被引頻次
書目名稱Approximation Theory XV: San Antonio 2016被引頻次學(xué)科排名
書目名稱Approximation Theory XV: San Antonio 2016年度引用
書目名稱Approximation Theory XV: San Antonio 2016年度引用學(xué)科排名
書目名稱Approximation Theory XV: San Antonio 2016讀者反饋
書目名稱Approximation Theory XV: San Antonio 2016讀者反饋學(xué)科排名
作者: humectant 時間: 2025-3-21 21:54 作者: institute 時間: 2025-3-22 02:11 作者: 驚呼 時間: 2025-3-22 06:47
Approximation by , Splines on Piecewise Conic Domains,We develop a Hermite interpolation scheme and prove error bounds for . bivariate piecewise polynomial spaces of Argyris type vanishing on the boundary of curved domains enclosed by piecewise conics.作者: stroke 時間: 2025-3-22 11:31 作者: 暴露他抗議 時間: 2025-3-22 15:39
On Polynomials with Vanishing Hessians and Some Density Problems,We propose a conjecture regarding homogeneous polynomials with vanishing Hessian and indicate some evidence for its validity. The conjecture is related to a question of Allan Pinkus and Bronislaw Wajnryb regarding density of certain classes of polynomials.作者: Intuitive 時間: 2025-3-22 19:05
A Polygonal Spline Method for General Second-Order Elliptic Equations and Its Applications,line method will be studied. Also, we will use this approach to numerically study the solution of some mixed parabolic and hyperbolic partial differential equations. Comparison with standard bivariate spline method will be given to demonstrate that our polygonal splines have some better numerical performance.作者: Delude 時間: 2025-3-23 01:14
A Class of Intrinsic Trigonometric Mode Polynomials, provide sufficient conditions for a positiveness of the instantaneous frequency, number of zeros and extrema, and the proximity of upper and lower envelopes. The question of necessity of each of the conditions is discussed in numerical examples. We also introduce an orthonormal basis in . of weak intrinsic mode functions.作者: 神刊 時間: 2025-3-23 05:26 作者: confederacy 時間: 2025-3-23 08:49 作者: 編輯才信任 時間: 2025-3-23 12:29
Erforschung und Entwicklung von Communities provide sufficient conditions for a positiveness of the instantaneous frequency, number of zeros and extrema, and the proximity of upper and lower envelopes. The question of necessity of each of the conditions is discussed in numerical examples. We also introduce an orthonormal basis in . of weak intrinsic mode functions.作者: Orgasm 時間: 2025-3-23 16:21 作者: opportune 時間: 2025-3-23 20:03 作者: antedate 時間: 2025-3-24 01:14
Gregory E. Fasshauer,Larry L. SchumakerContains journal-quality papers discussing the latest research advances in a variety of subareas of Approximation Theory.Includes supplementary material: 作者: Hdl348 時間: 2025-3-24 05:23 作者: anachronistic 時間: 2025-3-24 10:20 作者: 變色龍 時間: 2025-3-24 14:05
Erfolgswirkungen von Markenallianzenpolation with a properly defined rescaling operation, which smooths the oscillations of the interpolant. Although promising, this procedure lacks a systematic theoretical investigation. Through our analysis, this novel method can be understood as standard kernel interpolation by means of a properly 作者: ambivalence 時間: 2025-3-24 17:31 作者: Obsessed 時間: 2025-3-24 21:47
Erfolgsworkshop Vertrieb - Packen Sie‘s an!trary shape. The scheme is spectrally accurate for smooth functions. The main advantage of the technique is that, unlike most spectral approximation schemes in higher dimensions, it is not limited to domains with tensor-product structure. The scheme itself is a discrete least squares approximation i作者: excrete 時間: 2025-3-24 23:51 作者: 前奏曲 時間: 2025-3-25 04:52
https://doi.org/10.1007/978-3-663-20379-7ultimate goal is to find a PDE-solution-dependent triangulation which improves both the accuracy and computational efficiency of the spline solution. We present little theory to guide our search for such a triangulation, but instead approach the problem numerically. Starting with some initial triang作者: 內(nèi)部 時間: 2025-3-25 08:08
https://doi.org/10.1007/978-3-663-20379-7 Fourier transform . of a nonzero compactly supported scalar-valued function satisfying the refinement equation . with . dilation . does not vanish at infinity so by the Riemann–Lebesgue lemma . is not integrable. Dai, Feng, and Wang [.] extended his result to scalar-valued solutions of . where . ar作者: 紅潤 時間: 2025-3-25 12:14
Günter Blunk,Klaus Kra?,Jan Kollarplines on triangulations with hanging vertices. Allowing triangulations with hanging vertices provides much more flexibility than using ordinary triangulations and allows for simple adaptive algorithms based on local refinements. The use of these techniques is illustrated for two application areas o作者: 相信 時間: 2025-3-25 19:26
Günter Blunk,Klaus Kra?,Jan Kollarhand side, we have ., where . is a polynomial of degree ., and on the right, an entire function of exponential type. We discuss the role of this type of scaling limit in a number of topics: Bernstein’s constant for approximation of .; universality limits for random matrices; asymptotics of . Christo作者: persistence 時間: 2025-3-25 23:33
https://doi.org/10.1007/978-3-663-07203-4of Tchebycheffian B-splines and form an attractive alternative to standard polynomial B-splines and NURBS in both modeling and simulation. We summarize their definition and main properties, and we illustrate their use in a selection of numerical examples in the context of isogeometric analysis. For 作者: conifer 時間: 2025-3-26 00:42
,Kurzfassung des Abschlu?berichtes,e show that by distributing the batches computationally, a significant speedup in the convergence rate is provably possible compared to either batched sampling or weighted sampling alone. We propose several computationally efficient schemes to approximate the optimal weights and compute proposed sam作者: 輕打 時間: 2025-3-26 07:51
,Kurzfassung des Abschlu?berichtes,e., the fractional-order logistic equation. The use of the fractional B-splines allows us to express the fractional derivatives of the approximating function in an analytical form. Thus, the fractional collocation method is easy to implement, accurate, and efficient. Several numerical tests illustra作者: Criteria 時間: 2025-3-26 10:01 作者: padding 時間: 2025-3-26 13:07 作者: Unsaturated-Fat 時間: 2025-3-26 17:14 作者: Indebted 時間: 2025-3-26 21:00
Erforschung und Entwicklung von Communitiesdefined on the kernel-based probability spaces induced by the positive definite kernels. We focus on the kernel-based regression solutions of the multiple Poisson equations. Under the kernel-based probability measures, we show many properties of the kernel-based regression solutions including approx作者: 可以任性 時間: 2025-3-27 03:53
Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness,ts of 1988 to force it to interpolate exactly the monomials up?to a certain degree. This is obtained by modifying a few weights at each extremity of the interval of interpolation. Numerical experience demonstrates that the method is indeed able to interpolate with much higher orders than the original 1988 interpolant and in a very stable way.作者: 討好美人 時間: 2025-3-27 05:25
Potential Theoretic Approach to Design of Accurate Numerical Integration Formulas in Weighted Hardyalue of the norms, which gives a criterion for an optimal sequence of sampling points for numerical integration. Based on the expression, we propose an algorithm designing accurate numerical integration formulas on the space by a potential theoretic approach. The effectiveness of the designed formulas is supported by some numerical examples.作者: cringe 時間: 2025-3-27 12:24
https://doi.org/10.1007/978-3-663-20379-7n a solenoidal representation of . and deep results of Erd?s and Mahler [.]; Odoni [.] that gives lower bounds for the asymptotic density of integers represented by integral binary forms of degree . degree ., respectively. We also construct an integrable vector-valued refinable function with PV dilation.作者: Spinal-Tap 時間: 2025-3-27 16:14
Refinable Functions with PV Dilations,n a solenoidal representation of . and deep results of Erd?s and Mahler [.]; Odoni [.] that gives lower bounds for the asymptotic density of integers represented by integral binary forms of degree . degree ., respectively. We also construct an integrable vector-valued refinable function with PV dilation.作者: 財政 時間: 2025-3-27 21:00 作者: Creatinine-Test 時間: 2025-3-28 00:45
2194-1009 ary material: .These proceedings are based on papers presented at the international conference Approximation?Theory XV, which was held May 22–25, 2016 in San Antonio, Texas.?The conference was the fifteenth in a series of meetings in Approximation Theory?held at various locations in the United State作者: 懶惰人民 時間: 2025-3-28 04:48 作者: PACK 時間: 2025-3-28 06:31 作者: GROG 時間: 2025-3-28 11:19
Günter Blunk,Klaus Kra?,Jan Kollarof scaling limit in a number of topics: Bernstein’s constant for approximation of .; universality limits for random matrices; asymptotics of . Christoffel functions and Nikolskii inequalities; and Marcinkiewicz–Zygmund inequalities. Along the way, we mention a number of unsolved problems.作者: creditor 時間: 2025-3-28 18:12
https://doi.org/10.1007/978-3-663-07203-4e their definition and main properties, and we illustrate their use in a selection of numerical examples in the context of isogeometric analysis. For practical applications, we mainly focus on trigonometric and hyperbolic generalized B-splines.作者: 變量 時間: 2025-3-28 22:01
,Kurzfassung des Abschlu?berichtes, sampling or weighted sampling alone. We propose several computationally efficient schemes to approximate the optimal weights and compute proposed sampling distributions explicitly for the least squares and hinge loss problems. We show both analytically and experimentally that substantial gains can be obtained.作者: 安心地散步 時間: 2025-3-29 01:45
,Kurzfassung des Abschlu?berichtes,unction in an analytical form. Thus, the fractional collocation method is easy to implement, accurate, and efficient. Several numerical tests illustrate the efficiency of the proposed collocation method.作者: Cryptic 時間: 2025-3-29 06:59 作者: groggy 時間: 2025-3-29 09:27 作者: 小說 時間: 2025-3-29 15:20 作者: 性冷淡 時間: 2025-3-29 18:11 作者: 用不完 時間: 2025-3-29 20:41 作者: Nerve-Block 時間: 2025-3-30 03:17
Batched Stochastic Gradient Descent with Weighted Sampling, sampling or weighted sampling alone. We propose several computationally efficient schemes to approximate the optimal weights and compute proposed sampling distributions explicitly for the least squares and hinge loss problems. We show both analytically and experimentally that substantial gains can be obtained.作者: 煉油廠 時間: 2025-3-30 05:22
A Fractional Spline Collocation Method for the Fractional-order Logistic Equation,unction in an analytical form. Thus, the fractional collocation method is easy to implement, accurate, and efficient. Several numerical tests illustrate the efficiency of the proposed collocation method.作者: cliche 時間: 2025-3-30 08:16
Kernel-Based Approximation Methods for Partial Differential Equations: Deterministic or Stochastic iple Poisson equations. Under the kernel-based probability measures, we show many properties of the kernel-based regression solutions including approximate formulas, convergence, acceptable errors, and optimal initialization. The numerical experiments show good results for the kernel-based regression solutions for the large-scale data.作者: 小丑 時間: 2025-3-30 12:56 作者: instructive 時間: 2025-3-30 19:19 作者: 飛鏢 時間: 2025-3-30 23:40
Flavors of Compressive Sensing,o highlighting connections with other disciplines that have enriched the theory, e.g., statistics, sampling theory, probability, optimization, metagenomics, graph theory, frame theory, and Banach space geometry.作者: IRS 時間: 2025-3-31 01:42 作者: 作嘔 時間: 2025-3-31 07:00
https://doi.org/10.1007/978-3-322-89153-2ts of 1988 to force it to interpolate exactly the monomials up?to a certain degree. This is obtained by modifying a few weights at each extremity of the interval of interpolation. Numerical experience demonstrates that the method is indeed able to interpolate with much higher orders than the original 1988 interpolant and in a very stable way.作者: –吃 時間: 2025-3-31 13:01
Bewusste und unbewusste Wissensverarbeitungalue of the norms, which gives a criterion for an optimal sequence of sampling points for numerical integration. Based on the expression, we propose an algorithm designing accurate numerical integration formulas on the space by a potential theoretic approach. The effectiveness of the designed formulas is supported by some numerical examples.作者: 新陳代謝 時間: 2025-3-31 15:13 作者: chassis 時間: 2025-3-31 21:29
https://doi.org/10.1007/978-3-663-20379-7o measure the effectiveness of a spline solution over a given triangulation. Extensive numerical experiments have been conducted and are summarized in this paper. In addition, we report a heuristic for generating an initial solution-dependent triangulation and show numerical evidence that this algor作者: 破譯密碼 時間: 2025-4-1 00:33
Conference proceedings 2017on theory in signal processing,?compressive sensing, rational interpolation, spline approximation in isogeometric analysis, approximation of fractional differential equations, numerical integration formulas, and trigonometric polynomial approximation..作者: Jacket 時間: 2025-4-1 04:49
Computing with Functions on Domains with Arbitrary Shapes,operations for domains that do have tensor-product structure. The scheme applies to domains even with fractal shapes, such as the Mandelbrot set, since such domains are defined precisely by their characteristic function.作者: 鬼魂 時間: 2025-4-1 09:38 作者: ALLEY 時間: 2025-4-1 11:55 作者: Legion 時間: 2025-4-1 16:24
Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness, the most efficient infinitely smooth interpolants, in particular with equispaced points. In the present contribution, we introduce a new way of obtaining linear barycentric rational interpolants with relatively high orders of convergence. The basic idea is to modify the interpolant with equal weigh作者: liaison 時間: 2025-4-1 22:21 作者: REIGN 時間: 2025-4-2 01:04
Flavors of Compressive Sensing, incomplete information about them. Perhaps more importantly, practical procedures to perform the recovery were also provided. These realizations had a tremendous impact in science and engineering. They gave rise to a field called ‘compressive sensing,’ which is now in a mature state and whose found
