Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].

Rational Function Interpolation of Electromagnetic Transfer Functions of High-Speed Interconnect Systems from Discrete Time-Domain and Frequency-Domain Data

We present new methodologies to generate rational function approximations of broadband electromagnetic responses of linear and passive networks of high-speed interconnects, and to construct SPICE-compatible, equivalent circuit representations of the generated rational functions. These new methodologies are driven by the desire to improve the computational efficiency of the rational function fitting process, and to ensure enhanced accuracy of the generated rational function interpolation and its equivalent circuit representation. Toward this goal, we propose two new methodologies for rational function approximation of high-speed interconnect network responses. The first one relies on the use of both time-domain and frequency-domain data, obtained either through measurement or numerical simulation, to generate a rational function representation that extrapolates the input, early-time transient response data to late-time response while at the same time providing a means to both interpolate and extrapolate the used frequency-domain data. The aforementioned hybrid methodology can be considered as a generalization of the frequency-domain rational function fitting utilizing frequency-domain response data only, and the time-domain rational function fitting utilizing transient response data only. In this context, a guideline is proposed for estimating the order of the rational function approximation from transient data. The availability of such an estimate expedites the time-domain rational function fitting process. The second approach relies on the extraction of the delay associated with causal electromagnetic responses of interconnect systems to provide for a more stable rational function process utilizing a lower-order rational function interpolation. A distinctive feature of the proposed methodology is its utilization of scattering parameters. For both methodologies, the approach of fitting the electromagnetic network matrix one element at a time is applied. It is shown that, with regard to the computational cost of the rational function fitting process, such an element-by-element rational function fitting is more advantageous than full matrix fitting for systems with a large number of ports. Despite the disadvantage that different sets of poles are used in the rational function of different elements in the network matrix, such an approach provides for improved accuracy in the fitting of network matrices of systems characterized by both strongly coupled and weakly coupled ports. Finally, in order to provide a means for enforcing passivity in the adopted element-by-element rational function fitting approach, the methodology for passivity enforcement via quadratic programming is modified appropriately for this purpose and demonstrated in the context of element-by-element rational function fitting of the admittance matrix of an electromagnetic multiport.

Modeling for control design of a multi-reach water canal

This article addresses the problem of obtaining reduced complexity models of multi-reach water delivery canals that are suitable for robust and linear parameter varying (LPV) control design. In the first stage, by applying a method known from the literature, a finite dimensional rational transfer function of a priori defined order is obtained for each canal reach by linearizing the Saint-Venant equations. Then, by using block diagrams algebra, these different models are combined with linearized gate models in order to obtain the overall canal model. In what concerns the control design objectives, this approach has the advantages of providing a model with prescribed order and to quantify the high frequency uncertainty due to model approximation. A case study with a 3-reach canal is presented, and the resulting model is compared with experimental data. © 2014 IEEE.

Modeling for control design of a multi-reach water canal

This article addresses the problem of obtaining reduced complexity models of multi-reach water delivery canals that are suitable for robust and linear parameter varying (LPV) control design. In the first stage, by applying a method known from the literature, a finite dimensional rational transfer function of a priori defined order is obtained for each canal reach by linearizing the Saint-Venant equations. Then, by using block diagrams algebra, these different models are combined with linearized gate models in order to obtain the overall canal model. In what concerns the control design objectives, this approach has the advantages of providing a model with prescribed order and to quantify the high frequency uncertainty due to model approximation. A case study with a 3-reach canal is presented, and the resulting model is compared with experimental data. © 2014 IEEE.

O ensino e a aprendizagem das funções racionais com a calculadora gráfica: uma experiência com alunos do 11ºano

Relatório de estágio de mestrado em Ensino de Matemática no 3.º Ciclo do Ensino Básico e no Ensino Secundário

Mesure de Mahler supérieure de certaines fonctions rationelles

Nous exprimons la mesure de Mahler 2-supérieure et 3-supérieure de certaines fonctions rationnelles en terme de valeurs spéciales de la fonction zêta, de fonctions L et de polylogarithmes multiples. Les résultats obtenus sont une généralisation de ceux obtenus dans [10] pour la mesure de Mahler classique. On améliore un de ces résultats en réduisant une combinaison linéaire de polylogarithmes multiples en termes de valeurs spéciales de fonctions L. On termine avec la réduction complète d’un cas particuler.

Faktorisierung in Schief-Polynomringen

In der Arbeit werden zunächst die wesentlichsten Fakten über Schiefpolynome wiederholt, der Fokus liegt dabei auf Shift- und q-Shift-Operatoren in Charakteristik Null. Alle für die Arithmetik mit diesen Objekten notwendigen Konzepte und Algorithmen finden sich im ersten Kapitel. Einige der zur Bestimmung von Lösungen notwendigen Daten können aus dem Newtonpolygon, einer den Operatoren zugeordneten geometrischen Figur, abgelesen werden. Die Herleitung dieser Zusammenhänge ist das Thema des zweiten Kapitels der Arbeit, wobei dies insbesondere im q-Shift-Fall in dieser Form neu ist. Das dritte Kapitel beschäftigt sich mit der Bestimmung polynomieller und rationaler Lösungen dieser Operatoren, dabei folgt es im Wesentlichen der Darstellung von Mark van Hoeij. Der für die Faktorisierung von (q-)Shift Operatoren interessanteste Fall sind die sogenannten (q-)hypergeometrischen Lösungen, die direkt zu Rechtsfaktoren erster Ordnung korrespondieren. Im vierten Kapitel wird der van Hoeij-Algorithmus vom Shift- auf den q-Shift-Fall übertragen. Außerdem wird eine deutliche Verbesserung des q-Petkovsek-Algorithmus mit Hilfe der Daten des Newtonpolygons hergeleitet. Das fünfte Kapitel widmet sich der Berechnung allgemeiner Faktoren, wozu zunächst der adjungierte Operator eingeführt wird, der die Berechnung von Linksfaktoren erlaubt. Dann wird ein Algorithmus zur Berechnung von Rechtsfaktoren beliebiger Ordnung dargestellt. Für die praktische Benutzung ist dies allerdings für höhere Ordnungen unpraktikabel. Bei fast allen vorgestellten Algorithmen tritt das Lösen linearer Gleichungssysteme über rationalen Funktionenkörpern als Zwischenschritt auf. Dies ist in den meisten Computeralgebrasystemen nicht befriedigend gelöst. Aus diesem Grund wird im letzten Kapitel ein auf Evaluation und Interpolation basierender Algorithmus zur Lösung dieses Problems vorgestellt, der in allen getesteten Systemen den Standard-Algorithmen deutlich überlegen ist. Alle Algorithmen der Arbeit sind in einem MuPAD-Package implementiert, das der Arbeit beiliegt und eine komfortable Handhabung der auftretenden Objekte erlaubt. Mit diesem Paket können in MuPAD nun viele Probleme gelöst werden, für die es vorher keine Funktionen gab.

MA160exam01

Exam questions and solutions in LaTex. Diagrams for the questions are all together in the support.zip file, as .eps files

MA160exam01pdf

Exam questions and solutions in PDF

Gaussian quadrature rules with simple node-weight relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.

Nonlinear (2+1)-dimensional systems solvable through asymptotic modules

Some nonlinear differential systems in (2+1) dimensions are characterized by means of asymptotic modules involving two poles and a ring of linear differential operators with scalar coefficients.Rational and soliton-like are exhibited. If these coefficients are rational functions, the formalism leads to nonlinear evolution equations with constraints. © 1989.

Inclusão do efeito da frequência nas equações de estado de linhas bifásicas: análise no domínio do tempo

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Inclusão do efeito corona em modelos de linhas de transmissão bifásica utilizando a técnica de variáveis de estado

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Multiseries Lie groups and asymptotic modules for characterizing and solving integrable models

A multiseries integrable model (MSIM) is defined as a family of compatible flows on an infinite-dimensional Lie group of N-tuples of formal series around N given poles on the Riemann sphere. Broad classes of solutions to a MSIM are characterized through modules over rings of rational functions, called asymptotic modules. Possible ways for constructing asymptotic modules are Riemann-Hilbert and ∂̄ problems. When MSIM's are written in terms of the group coordinates, some of them can be contracted into standard integrable models involving a small number of scalar functions only. Simple contractible MSIM's corresponding to one pole, yield the Ablowitz-Kaup-Newell-Segur (AKNS) hierarchy. Two-pole contractible MSIM's are exhibited, which lead to a hierarchy of solvable systems of nonlinear differential equations consisting of (2 + 1) -dimensional evolution equations and of quite strong differential constraints. © 1989 American Institute of Physics.