Log in

Relevant bibliographies by topics / Polynomial constraints

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Polynomial constraints'

Author: Grafiati

Published: 4 June 2021

Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Polynomial constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Polynomial constraints"

1

ZHANG, GUI-FANG, and XIAO-SHAN GAO. "WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS." International Journal of Computational Geometry & Applications 16, no. 05n06 (2006): 461–78. http://dx.doi.org/10.1142/s0218195906002142.

Full text

Abstract:

In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in such a way that the new constraint problem G is well-constrained and the set of equations to be solved simultaneously in order to solve G has the smallest size. We propose a polynomial time algorithm which gives a partial solution to the above problem.

APA, Harvard, Vancouver, ISO, and other styles

2

Bergenti, Federico, Stefania Monica, and Gianfranco Rossi. "Constraint Logic Programming with Polynomial Constraints over Finite Domains." Fundamenta Informaticae 161, no. 1-2 (2018): 9–27. http://dx.doi.org/10.3233/fi-2018-1693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Huong, N. T. T., J. C. Yao, and N. D. Yen. "Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications." SIAM Journal on Optimization 26, no. 2 (2016): 1060–71. http://dx.doi.org/10.1137/15m1041134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

CHATURVEDI, S. "JACK POLYNOMIALS, GENERALIZED BINOMIAL COEFFICIENTS AND POLYNOMIAL SOLUTIONS OF THE GENERALIZED LAPLACE'S EQUATION." Modern Physics Letters A 13, no. 09 (1998): 715–25. http://dx.doi.org/10.1142/s0217732398000772.

Full text

Abstract:

We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace's equation which arises in the context of the Calogero–Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials and the constraints on the coefficients of expansion are derived. These constraints involve generalized binomial coefficients defined through Jack polynomials. Generalized binomial coefficients for partitions of k up to k=6 are tabulated.

APA, Harvard, Vancouver, ISO, and other styles

5

Khan, Moharram A. "Commutativity of rings with polynomial constraints." Czechoslovak Mathematical Journal 52, no. 2 (2002): 401–13. http://dx.doi.org/10.1023/a:1021743131799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pan, K., and E. B. Saff. "Best Polynomial Approximation with Linear Constraints." Canadian Journal of Mathematics 44, no. 6 (1992): 1289–302. http://dx.doi.org/10.4153/cjm-1992-077-5.

Full text

Abstract:

AbstractLet A be a (k + 1) × (k + 1) nonzero matrix. For polynomials p ∈ Pn, set and . Let E ⊂ C be a compact set that does not separate the plane and f be a function continuous on E and analytic in the interior of E. Set and . Our goal is to study approximation to f on E by polynomials from Bn(A). We obtain necessary and sufficient conditions on the matrix A for the convergence En(A,f) → 0 to take place. These results depend on whether zero lies inside, on the boundary or outside E and yield generalizations of theorems of Clunie, Hasson and Saff for approximation by polynomials that omit a po

APA, Harvard, Vancouver, ISO, and other styles

7

Liu, Ye, GeShi Tang, AnXi Yu, JuBo Zhu, and DianNong Liang. "Sliding polynomial modeling with equality constraints." Science China Technological Sciences 56, no. 7 (2013): 1818–24. http://dx.doi.org/10.1007/s11431-013-5231-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nowacki, Horst, and Xinmin Lü. "Fairing composite polynomial curves with constraints." Computer Aided Geometric Design 11, no. 1 (1994): 1–15. http://dx.doi.org/10.1016/0167-8396(94)90022-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ahmadi, Amir Ali, and Georgina Hall. "On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity." Mathematics of Operations Research 44, no. 4 (2019): 1192–207. http://dx.doi.org/10.1287/moor.2018.0962.

Full text

Abstract:

In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial minimization problems have gained much popularity. At their heart, these hierarchies rely crucially on Positivstellensätze from the late 20th century (e.g., due to Stengle, Putinar, or Schmüdgen) that certify positivity of a polynomial on an arbitrary closed basic semialgebraic set. In this paper, we show that such hierarchies could in fact be designed from much more limited Positivstellensätze dating back to the early 20th century that only certify posit

APA, Harvard, Vancouver, ISO, and other styles

10

Yamaguchi, Shingo, and Mohd Anuaruddin Bin Ahmadon. "Process tree-based analysis method of DECLARE relation constraints in acyclic bridge-less well-structured workflow nets." ECTI Transactions on Computer and Information Technology (ECTI-CIT) 13, no. 2 (2019): 104–11. http://dx.doi.org/10.37936/ecti-cit.2019132.203107.

Full text

Abstract:

In this paper, we proposed a method to analyze workflows’ constraints whose templates are defined in a declarative language called DECLARE. Checking such constraints is important but known to be intractable in general. Our results show three things. First, utilizing a tree representation of workflow process called {\it process tree}, we provided necessary and sufficient conditions on the constraints. Second, those conditions enable us to not only check a given constraint in polynomial time but also find a clue for improving the net if it violates the constraint. Third, we revealed the relation

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Polynomial constraints"

1

McDonald, Terry Lynn. "Piecewise polynomial functions on a planar region: boundary constraints and polyhedral subdivisions." Texas A&M University, 2003. http://hdl.handle.net/1969.1/3915.

Full text

Abstract:

Splines are piecewise polynomial functions of a given order of smoothness r on a triangulated region (or polyhedrally subdivided region) of Rd. The set of splines of degree at most k forms a vector space Crk() Moreover, a nice way to study Cr k()is to embed n Rd+1, and form the cone b of with the origin. It turns out that the set of splines on b is a graded module Cr b() over the polynomial ring R[x1; : : : ; xd+1], and the dimension of Cr k() is the dimension o This dissertation follows the works of Billera and Rose, as well as Schenck and Stillman, who each approached the study of splines fr

APA, Harvard, Vancouver, ISO, and other styles

2

Ankelhed, Daniel. "On low order controller synthesis using rational constraints." Licentiate thesis, Linköping : Department of Electrical Engineering, Linköping University, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Piprek, Patrick [Verfasser], Florian [Akademischer Betreuer] Holzapfel, Sébastien [Gutachter] Gros, and Florian [Gutachter] Holzapfel. "Robust Trajectory Optimization Applying Chance Constraints and Generalized Polynomial Chaos / Patrick Piprek ; Gutachter: Sébastien Gros, Florian Holzapfel ; Betreuer: Florian Holzapfel." München : Universitätsbibliothek der TU München, 2020. http://d-nb.info/1211086992/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fotiou, Ioannis A. "Parametric optimization and constrained optimal control for polynomial dynamical systems." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Timko, Edward J. "Polynomial Tuples of Commuting Isometries Constrained by 1-Dimensional Varieties." Thesis, Indiana University, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10288530.

Full text

Abstract:

<p> We investigate the properties of finite tuples of commuting isometries that are constrained by a system of polynomial equations. More precisely, suppose <i>I</i> is an ideal in the ring of complex <i> n</i>-variable polynomials and that <i>I</i> determines an affine algebraic variety of dimension 1. Further, suppose that there are <i> n</i> commuting Hilbert space isometries <i>V</i><sub>1</sub>, . . . ,<i>V<sub>n</sub></i> with the property that <i>p</i>(<i> V<sub>1</sub></i>, . . . ,<i>V<sup>n</sup></i>) = 0 for each <i>p</i> in the ideal <i>I.</i> Because the <i> n</i>-tuple (<i>V</i><s

APA, Harvard, Vancouver, ISO, and other styles

6

Bush, Julia K. "Optimal Slewing of a Constrained Telescope Using Seventh Order Polynomial Input Torques." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/860.

Full text

Abstract:

Two-axis gimbals are frequently used to point cameras and telescopes at various points of interest for surveillance, science, and art. The rotation of a two-axis gimbal system is governed by nonlinear angular momentum equations of motion. This paper presents a method for slewing a telescope in space with a gimbaled sensor attached to a nominally non-rotating spacecraft using two seventh order polynomial input functions to characterize torques. To accomplish this task, picking the optimal coefficients of the seventh order polynomial was necessary. It was also desired to use constraint equations

APA, Harvard, Vancouver, ISO, and other styles

7

Briquel, Irénée. "Complexity issues in counting, polynomial evaluation and zero finding." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2011. http://tel.archives-ouvertes.fr/tel-00665782.

Full text

Abstract:

In the present thesis, we try to compare the classical boolean complexity with the algebraic complexity, by studying problems related to polynomials. We consider the algebraic models from Valiant and from Blum, Shub and Smale (BSS). To study the algebraic complexity classes, one can start from results and open questions from the boolean case, and look at their translation in the algebraic context. The comparison of the results obtained in the two settings will then boost our understanding of both complexity theories. The first part follows this framework. By considering a polynomial canonicall

APA, Harvard, Vancouver, ISO, and other styles

8

Weisser, Tillmann. "Computing approximations and generalized solutions using moments and positive polynomials." Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30140/document.

Full text

Abstract:

Le problème généralisé des moments (PGM) est un problème d'optimisation linéaire sur des espaces de mesures. Il permet de modéliser simplement un grand nombre d'applications. En toute généralité il est impossible à résoudre mais si ses données sont des polynômes et des ensembles semi-algébriques alors on peut définir une hiérarchie de relaxations semidéfinies (SDP) - la hiérarchie moments-sommes-de-carrés (moments-SOS) - qui permet en principe d'approcher la valeur optimale avec une précision arbitraire. Le travail contenu dans cette thèse adresse deux facettes concernants le PGM et la hiérarc

APA, Harvard, Vancouver, ISO, and other styles

9

Barry, Timothy John, and timothyjbarry@yahoo com au. "A data driven approach to constrained control." RMIT University. Electrical and Computer Engineering, 2004. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20091214.161712.

Full text

Abstract:

This thesis presents a data-driven approach to constrained control in the form of a subspace-based state-space system identification algorithm integrated into a model predictive controller. Generally this approach has been termed model-free predictive control in the literature. Previous research into this area focused on the system identification aspects resulting in an omission of many of the features that would make such a control strategy attractive to industry. These features include constraint handling, zero-offset setpoint tracking and non-stationary disturbance rejection.

APA, Harvard, Vancouver, ISO, and other styles

10

Mayer, Robert, James McDaniels, and Lou F. Kalil. "VITERBI DECODER FOR NASA’S SPACE SHUTTLE’S TELEMETRY DATA." International Foundation for Telemetering, 1992. http://hdl.handle.net/10150/608938.

Full text

Abstract:

International Telemetering Conference Proceedings / October 26-29, 1992 / Town and Country Hotel and Convention Center, San Diego, California<br>In the event of a NASA Space Shuttle mission landing at the While Sands Missile Range, White Sands, New Mexico, a data communications system for processing Shuttle’s telemetry data has been installed there in the Master Control Telemetry Station, JIG-56. This data system required a Viterbi decoder since the Shuttle’s data is convolutionally encoded. However, the Shuttle uses a nonstandard code, and the manufacturer which in the past has provided

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Polynomial constraints"

1

Freund, Roland W. On the constrained Chebyshev approximation problem on ellipses. Research Institute for Advanced Computer Science, NASA Ames Research Center, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Its, Alexander R. Random matrix theory and integrable systems. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.10.

Full text

Abstract:

This article discusses the interaction between random matrix theory (RMT) and integrable theory, leading to ordinary and partial differential equations (PDEs) for the eigenvalue distribution of random matrix models of size n and the transition probabilities of non-intersecting Brownian motion models, for finite n and for n → ∞. It first provides an overview of the connection between the theory of orthogonal polynomials and the KP-hierarchy in integrable systems before examining matrix models and the Virasoro constraints. It then considers multiple orthogonal polynomials, taking into account no

APA, Harvard, Vancouver, ISO, and other styles

3

Recovery of Unknown Constraint Length and Encoder Polynomials for Rate 1/2 Linear Convolutional Encoders. Storming Media, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Polynomial constraints"

1

Lorentz, George G., Yuly Makovoz, and Manfred V. Golitschek. "Polynomial Approximation with Constraints." In Grundlehren der mathematischen Wissenschaften. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-60932-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Muller, Jean-Michel. "Polynomial Approximations with Special Constraints." In Elementary Functions. Birkhäuser Boston, 2016. http://dx.doi.org/10.1007/978-1-4899-7983-4_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Moosbrugger, Marcel, Ezio Bartocci, Joost-Pieter Katoen, and Laura Kovács. "Automated Termination Analysis of Polynomial Probabilistic Programs." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_18.

Full text

Abstract:

AbstractThe termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps. This paper presents a fully automated approach to the termination analysis of probabilistic while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST is undecidable in general, existing proof rules typically provide sufficient conditions. These conditions mostly involve constraints on supermartingales. We consider four proof rules from the literature and extend these with generalizations of existing proof rules for (P)AST. We automate the resulting set of proof rules by effectively computing asymptotic bounds on polynomials over the program variables. These bounds are used to decide the sufficient conditions – including the constraints on supermartingales – of a proof rule. Our software tool Amber can thus check AST, PAST, as well as their negations for a large class of polynomial probabilistic programs, while carrying out the termination reasoning fully with polynomial witnesses. Experimental results show the merits of our generalized proof rules and demonstrate that Amber can handle probabilistic programs that are out of reach for other state-of-the-art tools.

APA, Harvard, Vancouver, ISO, and other styles

4

Marnette, Bruno, Viktor Kuncak, and Martin Rinard. "Polynomial Constraints for Sets with Cardinality Bounds." In Foundations of Software Science and Computational Structures. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71389-0_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tung, Vu Xuan, To Van Khanh, and Mizuhito Ogawa. "raSAT: An SMT Solver for Polynomial Constraints." In Automated Reasoning. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40229-1_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Vale-Enriquez, Fernando, and Christopher W. Brown. "Polynomial Constraints and Unsat Cores in Tarski." In Mathematical Software – ICMS 2018. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96418-8_55.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Afrati, Foto, Stavros S. Cosmadakis, Stéphane Grumbach, and Gabriel M. Kuper. "Linear vs. polynomial constraints in database query languages." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58601-6_100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cheng, Chih-Hong, Harald Ruess, and Natarajan Shankar. "JBernstein: A Validity Checker for Generalized Polynomial Constraints." In Computer Aided Verification. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39799-8_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bank, Bernd, Teresa Krick, Reinhard Mandel, and Pablo Solernó. "A geometrical bound for integer programming with polynomial constraints." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54458-5_56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Errami, Hassan, Werner M. Seiler, Thomas Sturm, and Andreas Weber. "On Muldowney’s Criteria for Polynomial Vector Fields with Constraints." In Computer Algebra in Scientific Computing. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23568-9_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Polynomial constraints"

1

Koller, Alexander, Kurt Mehlhorn, and Joachim Niehren. "A polynomial-time fragment of dominance constraints." In the 38th Annual Meeting. Association for Computational Linguistics, 2000. http://dx.doi.org/10.3115/1075218.1075265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gussner, Thomas, and Jurgen Adamy. "Controller Design for Polynomial Systems with Input Constraints." In 2009 Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC 2009). IEEE, 2009. http://dx.doi.org/10.1109/cdc.2009.5400942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pan, Victor Y. "Univariate polynomial root-finding by arming with constraints." In the 2011 International Workshop. ACM Press, 2011. http://dx.doi.org/10.1145/2331684.2331702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Carbonnel, Clément, and Emmanuel Hebrard. "On the Kernelization of Global Constraints." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/81.

Full text

Abstract:

Kernelization is a powerful concept from parameterized complexity theory that captures (a certain idea of) efficient polynomial-time preprocessing for hard decision problems. However, exploiting this technique in the context of constraint programming is challenging. Building on recent results for the VertexCover constraint, we introduce novel "loss-less" kernelization variants that are tailored for constraint propagation. We showcase the theoretical interest of our ideas on two constraints, VertexCover and EdgeDominatingSet.

APA, Harvard, Vancouver, ISO, and other styles

5

Arikawa, Keisuke. "Symbolic Computation of Inverse Kinematics for General 6R Manipulators Based on Raghavan and Roth’s Solution." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22231.

Full text

Abstract:

Abstract We discuss the symbolic computation of inverse kinematics for serial 6R manipulators with arbitrary geometries (general 6R manipulators) based on Raghavan and Roth’s solution. The elements of the matrices required in the solution were symbolically calculated. In the symbolic computation, an algorithm for simplifying polynomials upon considering the symbolic constraints (constraints of the trigonometric functions and those of the rotation matrix), a method for symbolic elimination of the joint variables, and an efficient computation of the rational polynomials are presented. The elemen

APA, Harvard, Vancouver, ISO, and other styles

6

Schönherr, Jürgen. "Cam Motion Synthesis for Mixed Motion Constraints Using Well-Behaved Polynomials of High Order." In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/mech-1016.

Full text

Abstract:

Abstract A method of describing a function by a number of successive polynomials of unrestricted and varying degree has been developed to synthesize a cam motion for mixed constraints. The algorithm is based on the expression of the coefficients of a polynomial in terms of the constraints at interval boundaries. It enables the designer to satisfy numerous motion constraints while at the same time preserving the continuity of motion derivatives up to a high order. Unconstrained boundary values are calculated automatically by using an objective function that minimizes the oscillations of a motio

APA, Harvard, Vancouver, ISO, and other styles

7

Ren, Ping, and Clément Gosselin. "Trajectory Planning of Cable-Suspended Parallel Robots Using Interval Positive-Definite Polynomials." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71205.

Full text

Abstract:

In this paper, the dynamic point-to-point trajectory planning of cable-suspended robots is investigated. A simple planar two-degree-of-freedom (2-dof) robot is used to demonstrate the technique. In order to maintain the cables’ positive tension, a set of algebraic inequalities is derived from the dynamic model of the 2-dof robot. The trajectories are defined using parametric polynomials with the coefficients determined by the prescribed initial and final states, and the variable time duration. With the polynomials substituted into the inequality constraints, the planning problem is then conver

APA, Harvard, Vancouver, ISO, and other styles

8

Marmin, Arthur, Marc Castella, and Jean-Christophe Pesquet. "Robust Reconstruction with Nonconvex Subset Constraints: A Polynomial Optimization Approach." In 2020 IEEE 30th International Workshop on Machine Learning for Signal Processing (MLSP). IEEE, 2020. http://dx.doi.org/10.1109/mlsp49062.2020.9231524.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

González, Andrés L., and Jaime E. Meneses. "Double-frequency TPU method with geometric constraints and polynomial adjust." In Frontiers in Optics. OSA, 2019. http://dx.doi.org/10.1364/fio.2019.jw4a.100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yue, Xuerong, Jiji Gao, and Zhibin Chen. "A Polynomial Time Algorithm for Scheduling on Processing Time Constraints." In ICCNS 2019: 2019 the 9th International Conference on Communication and Network Security. ACM, 2019. http://dx.doi.org/10.1145/3371676.3371690.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Polynomial constraints"

1

Mikkelsen, Clark D. Least Squares Polynomial Regression With Constraints: A Computer Program. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada563679.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Andrews, Donald W. K., and Ray Fair. Estimation of Polynomial Distributed Lags and Leads with End Point Constraints. National Bureau of Economic Research, 1989. http://dx.doi.org/10.3386/t0079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!