Dissertations / Theses on the topic 'Hadamard'
To see the other types of publications on this topic, follow the link: Hadamard.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Hadamard.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Bailera, Martín Ivan. "Hadamard, quasi-Hadamard, and generalized Hadamard full propelinear codes." Doctoral thesis, TDX (Tesis Doctorals en Xarxa), 2020. http://hdl.handle.net/10803/670384.
Full textAbstract:
Aquesta tesi pertany als camps de la combinatòria algebraica i de la teoria matemàtica de la informació. Motivada per l’avantatge computacional de l’estructura full propelinear, estudiem diferents tipus de codis correctors d’errors dotats d’aquesta estructura. Com que un codi full propelinear és també un grup, és possible generar el codi a partir de les paraules associades als generadors com a grup, fins i tot si el codi és no lineal. Això ofereix els beneficis d’emmagatzematge d’un codi lineal. Rifà i Suárez van definir els codis full propelinear sobre matrius Hadamard binàries (HFP-codis) i van provar una equivalència amb els grups Hadamard. L’existència de matrius Hadamard d’ordres múltiple de quatre segueix sent un problema obert. Per tant, l’estudi de nous codis Hadamard pot contribuir a abordar la conjectura de Hadamard. Un codi amb una estructura full propelinear està compost per dos conjunts; paraules i permutacions. Definim el grup associat d’un HFP-codi com el grup format per les permutacions. Primerament, estudiem els HFP-codis amb un grup associat fixat. El següent pas és generalitzar a cossos finits els HFP-codis binaris. Després vam provar que l’existència de codis Hadamard full propelinear generalitzats és equivalent a l’existència de conjunts de diferències relatius amb paràmetres (v,w,v,v/w). A més, construïm famílies infinites de codis Hadamard full propelinear generalitzats no lineals. Finalment, definim el concepte de codi quasi-Hadamard full propelinear. També donem una equivalència entre els grups quasi-Hadamard i els codis quasi-Hadamard full propelinear. En tots els codis estudiats, analitzem el rang i la dimensió del nucli. Dos paràmetres que proporcionen informació sobre la linealitat d’un codi i sobre la noequivalència de codis.Esta tesis pertenece a los campos de la combinatoria algebraica y de la teoría matemática de la información. Motivada por la ventaja computacional de la estructura full propelinear, estudiamos diferentes tipos de códigos correctores de errores dotados de dicha estructura. Como un código full propelinear es también un grupo, es posible generar el código a partir de las palabras asociadas a los generadores como grupo, incluso si el código es no lineal. Esto ofrece los beneficios de almacenamiento de un código lineal. Rifà y Suárez definieron los códigos full propelinear sobre matrices Hadamard binarias (HFP-códigos) y probaron una equivalencia con los grupos Hadamard. La existencia de matrices Hadamard de órdenes múltiplo de cuatro sigue siendo un problema abierto. Por tanto, el estudio de nuevos códigos Hadamard puede contribuir a abordar la conjetura de Hadamard. Un código con una estructura full propelinear está compuesto por dos conjuntos; palabras y permutaciones. Definimos el grupo asociado de un HFP-código como el grupo formado por las permutaciones. Primeramente, estudiamos los HFP-códigos con un grupo asociado fijado. El siguiente paso es generalizar a cuerpos finitos los HFP-códigos binarios. Después probamos que la existencia de códigos Hadamard full propelinear generalizados es equivalente a la existencia de conjuntos de diferencias relativos con parámetros (v,w,v,v/w). Además, construimos familias infinitas de códigos Hadamard full propelinear generalizados no lineales. Finalmente, definimos el concepto de código quasi-Hadamard full propelinear. También damos una equivalencia entre los grupos quasi-Hadamard y los códigos quasi-Hadamard full propelinear. En todos los códigos estudiados, analizamos el rango y la dimensión del núcleo. Dos parámetros que proporcionan información sobre la linealidad de un código y sobre la no equivalencia de códigos.
This thesis belongs to the fields of algebraic combinatorics and mathematical information theory. Motivated by the computational advantage of the full propelinear structure, we study different kinds of error-correcting codes endowed with this structure. Since a full propelinear code is also a group, it is possible to generate the code from the codewords associated to the generators as a group, even if the code is nonlinear. This offers the data storage benefits of a linear code. Rifà and Suárez introduced full propelinear codes based on binary Hadamard matrices (HFP-codes) and they proved an equivalence with Hadamard groups. The existence of Hadamard matrices of orders a multiple of four remains an open problem. Therefore, the study of new Hadamard codes may contribute to address the Hadamard conjecture. A code with a full propelinear structure is composed of two sets, i.e., codewords and permutations. We define the associated group of an HFP-code as the group comprised of the permutations. Firstly, we study the HFP-codes with a fixed associated group. The next step is to generalize the binary HFP-codes to finite fields. Subsequently, we prove that the existence of generalized Hadamard full propelinear codes is equivalent to the existence of central relative (v,w,v,v/w)-difference sets. Furthermore, we build infinite families of nonlinear generalized Hadamard full propelinear codes. Finally, we introduce the concept of quasi-Hadamard full propelinear code. We also give an equivalence between quasi-Hadamard groups and quasi-Hadamard full propelinear codes. In all codes studied, we analyze the rank and the dimension of the kernel. Two parameters that provide information about the linearity of a code, and also about the nonequivalence of codes.
2
Parker, Keli Siqueiros. "Multilevel Hadamard Matrices." Wright State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=wright1307537681.
Full text
3
Buteau, Samuel. "Finding Hadamard and (epsilon,delta)-Quasi-Hadamard Matrices with Optimization Techniques." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35119.
Full textAbstract:
Existence problems (proving that a set is nonempty) abound in mathematics, so we look for generally applicable solutions (such as optimization techniques). To test and improve these techniques, we apply them to the Hadamard Conjecture (proving that Hadamard matrices exist in dimensions divisible by 4), which is a good example to study since Hadamard matrices have interesting applications (communication theory, quantum information theory, experiment design, etc.), are challenging to find, are easily distinguished from other matrices, are known to exist for many dimensions, etc.. In this thesis we study optimization algorithms (Exhaustive search, Hill Climbing, Metropolis, Gradient methods, generalizations thereof, etc.), improve their performance (when using a Graphical Processing Unit), and use them to attempt to find Hadamard matrices (real, and complex). Finally, we give an algorithm to prove non-trivial lower bounds on the Hamming distance between any given matrix with elements in {+1,-1} and the set of Hadamard matrices, then we use this algorithm to study matrices with similar properties to Hadamard matrices, but which are far away (with respect to the Hamming distance) from them.
4
Merchant, Eric. "Structural properties of Hadamard designs /." view abstract or download file of text, 2005. http://www.lib.umi.com/cr/uoregon/fullcit?p3181114.
Full textAbstract:
Thesis (Ph. D.)--University of Oregon, 2005.Typescript. Includes vita and abstract. Includes bibliographical references (leaves 58-59). Also available for download via the World Wide Web; free to University of Oregon users.
5
Van, Diggelen Frank Stephen Tromp. "Hadamard weighting in robust control." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359401.
Full text
6
Arslan, Aykut. "Discrete Fractional Hermite-Hadamard Inequality." TopSCHOLAR®, 2017. http://digitalcommons.wku.edu/theses/1940.
Full textAbstract:
This thesis is comprised of three main parts: The Hermite-Hadamard inequality on discrete time scales, the fractional Hermite-Hadamard inequality, and Karush-Kuhn- Tucker conditions on higher dimensional discrete domains. In the first part of the thesis, Chapters 2 & 3, we define a convex function on a special time scale T where all the time points are not uniformly distributed on a time line. With the use of the substitution rules of integration we prove the Hermite-Hadamard inequality for convex functions defined on T. In the fourth chapter, we introduce fractional order Hermite-Hadamard inequality and characterize convexity in terms of this inequality. In the fifth chapter, we discuss convexity on n{dimensional discrete time scales T = T1 × T2 × ... × Tn where Ti ⊂ R , i = 1; 2,…,n are discrete time scales which are not necessarily periodic. We introduce the discrete analogues of the fundamental concepts of real convex optimization such as convexity of a function, subgradients, and the Karush-Kuhn-Tucker conditions.
We close this thesis by two remarks for the future direction of the research in this area.
7
Zohner, Jochen [Verfasser]. "Idealtheorie in Hadamard-Algebren / Jochen Zohner." Gießen : Universitätsbibliothek, 2013. http://d-nb.info/1065183682/34.
Full text
8
Bërdëllima, Arian [Verfasser]. "Investigations in Hadamard spaces / Arian Bërdëllima." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2021. http://nbn-resolving.de/urn:nbn:de:gbv:7-21.11130/00-1735-0000-0008-58F4-2-2.
Full text
9
Tressler, Eric Paul. "A Survey of the Hadamard Conjecture." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/9898.
Full textAbstract:
Hadamard matrices are defined, and their basic properties outlined. A survey of historical and recent literature follows, in which a number of existence theorems are examined and given context. Finally, a new result for Hadamard matrices over $\Z_2$ is presented and given a graph-theoretic interpretation.Master of Science
10
Fok, Hou Kei. "Generalizations of some Hermite-Hadamard-type inequalities." Thesis, University of Macau, 2012. http://umaclib3.umac.mo/record=b2592934.
Full text
11
Ueno, Keisuke. "Constructions of harmonic maps between Hadamard manifolds /." Sendai : Tohoku Univ, 2001. http://www.loc.gov/catdir/toc/fy0708/2006478282.html.
Full text
12
Caramello, Junior Francisco Carlos. "Ações e folheações polares em variedades de Hadamard." Universidade Federal de São Carlos, 2014. https://repositorio.ufscar.br/handle/ufscar/7049.
Full textAbstract:
Submitted by Ronildo Prado (ronisp@ufscar.br) on 2016-08-30T20:16:50Z
No. of bitstreams: 1
6841.pdf: 671749 bytes, checksum: fee45931185f019b1c8d5bb4946465b0 (MD5)Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2016-08-30T20:17:52Z (GMT) No. of bitstreams: 1 6841.pdf: 671749 bytes, checksum: fee45931185f019b1c8d5bb4946465b0 (MD5)
Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2016-08-30T20:18:45Z (GMT) No. of bitstreams: 1 6841.pdf: 671749 bytes, checksum: fee45931185f019b1c8d5bb4946465b0 (MD5)
Made available in DSpace on 2016-08-30T20:19:00Z (GMT). No. of bitstreams: 1 6841.pdf: 671749 bytes, checksum: fee45931185f019b1c8d5bb4946465b0 (MD5) Previous issue date: 2014-02-27
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
O objetivo principal deste trabalho é apresentar alguns resultados recentes na teoria de folheações polares, também chamadas de folheações riemannianas singulares com seções, em variedades de curvatura não positiva, presentes no artigo [24]. As ações polares também são estudadas, pois são objetos de pesquisa ativa que motivam e ilustram o estudo das folheações polares. Fornecemos uma demonstração de que não existem folheações polares próprias em variedades compactas de curvatura não positiva. Além disso, apresentamos um resultado que descreve globalmente as folheações polares próprias em variedades de Hadamard. Abordamos este resultado também no contexto particular das ações polares, utilizando a teoria de subvariedades taut. As ações adjunta e por conjugação são brevemente estudadas como exemplos clássicos de ações polares.
This work aims at presenting some recent results on the theory of polar foliations, also know as singular riemannian foliations with sections, on nonpositively curved manifolds, as seen in T oben [24]. Polar actions are also studied, for they are active research subject that motivate and illustrate polar foliations. We give a proof of the nonexistence of proper polar foliations on compact manifolds of nonpositive curvature. Then we present a result that globally describes proper polar foliations on Hadamard manifolds. We prove this same result in the special case of polar actions by using the theory of taut submanifolds. The adjoint and conjugation actions are brie y presented as classical examples of polar actions.
13
Mendoza, Villacorta German. "Teorema de factorización de Hadamard para funciones enteras." Bachelor's thesis, Universidad Nacional Mayor de San Marcos, 2011. https://hdl.handle.net/20.500.12672/3436.
Full textAbstract:
Una función entera puede ser considerada como un “polinomio de grado infinito”.
Por lo tanto surge la siguiente pregunta ¿Puede la teoría de polinomios ser generalizada a una función entera? Por ejemplo ¿una función entera puede ser factorizada?.
El teorema de factorización de Hadamard afirma que toda función entera de orden finito posee género finito; esto nos da una forma de factorizar funciones enteras. Para ello estudiaremos los conceptos de rango, orden y género de funciones enteras y las relaciones que hay entre ellos.Tesis
14
Furis, Mihai Alexandru Johnson Jeremy. "Cache miss analysis of Walsh-Hadamard Transform algorithms /." Philadelphia : Drexel University, 2003. http://dspace.library.drexel.edu/handle/1721.1/109.
Full text
15
Burton, George Edmund C. "Hadamard subtractions for infrared singularities in quantum field theory." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5289.
Full textAbstract:
Feynman graphs in perturbative quantum field theory are replete with infrared divergences caused by the presence of massless particles, how-ever these divergences are known to cancel order-by-order when all virtual and real contributions to a given cross section are summed and smeared against an experimental resolution. In this thesis we treat the infrared problem formally in the language of distribution theory so that we can remove the divergences with local momentum space subtractions using Hadamard's procedure. This is analogous with the BPHZ mechanism for removing UV divergences. Our aim is to show how it is possible to make both the real and virtual subtractions analytically such that we are left with manifestly finite integrands. For the virtual graphs we present a new decomposition of the integrand in momentum space and remove those terms that are divergent. For the real graphs we show how the Taylor expansion of the momentum conserving delta function allows the explicit removal of the divergent part; furthermore we show that the homogeneous properties of the soft structure greatly simplifies this procedure.
16
Sharif, H. "Algebraic functions, differentially algebraic power series and Hadamard operations." Thesis, University of Kent, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235336.
Full text
17
Lopez, Enrique Martin. "Photonic quantum information processing with the complex Hadamard operator." Thesis, University of Bristol, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.680376.
Full textAbstract:
The exploitation of quantum mechanics for new technologies promises a revolution in computing, simulations, communication and metrology. In particular, quantum computation and simulation harness properties peculiar to quantum systems to process information using algorithms that run exponentially faster than their classical counterparts. While the Fourier Transform (FT) is a cornerstone tool for signal processing in science, engineering, and computing, the quantum version of the Fourier transform (QFT) is a key component of many quantum algorithms. And just as the FT has a generalisation known as the complex Hadamard, so the QFT is a special case of the quantum complex Hadamard (QCH) operator. This thesis reports implementations of the QFT and QCH, with photons in linear optical circuits, as core components for quantum information processing, quantum computation, and quantum simulations. The iterative QFT is implemented in 8hor's quantum factoring algorithm to demonstrate how qubits can be recycled to provide a resource saving. This included the first demonstration of two in-series photonic controlled logic gates. The four dimensional QCH was constructed with an internal phase implemented as a tuneable Berry phase to control quantum interference between two photons. A generator for this QCH, described as a highly connected graph, was simulated as a Hamiltonian, with full time evolution implemented in a fully reconfigurable optical network. Quantum simulations for the evolution of phonons in a model chain of atoms were performed, where QFT operators prepare and measure in a basis corresponding to localised excitations. Quantised vibrational wave packets in molecules, described as phonons in the harmonic approximation, were simulated
18
Barrolleta, Roland D. "Partial permutation decoding for Z4-linear hadamard and kerdock codes." Doctoral thesis, Universitat Autònoma de Barcelona, 2016. http://hdl.handle.net/10803/399279.
Full textAbstract:
El problema més difícil en el procés de transmetre informació és la descodificació. Una de les àrees més importants d'investigació dins de la teoria de la codificació es la recerca d'algoritmes eficients de descodificació. La descodificació per permutacions és una tècnica que depèn totalment de l'existència d'un subconjunt especial, anomenat PD-conjunt, del grup d'automorfismes d'un codi per contribuir a la descodificació dels vectors rebuts. Recentment, s'ha introduït un nou mètode de descodificació per permutacions idoni per a codis Z4-lineals. L'objectiu principal d'aquesta tesis és proporcionar s-PD-conjunts, els quals permeten la correcció de fins a s errors, per a algunes families de codis Z4-lineals per a l'aplicació de la descodificació per permutacions. Es donen fites superiors sobre els valors de s per als quals poden existir s-PD-conjunts de mida mínima s+1 per a codis de Hadamard sistemàtics i codis de Kerdock. Es proporcionen dos criteris diferents per trobar s-PD-conjunts de mida s+1 per a codis Z4-lineals. Es presenten construccions explicites i recursives de s-PD-conjunts de mida s+1 per a codis binaris lineals de Hadamard i per a codis Z4-lineals de Hadamard, que compleixen el primer criteri. Així mateix, es mostren construccions explicites de s-PD-conjunts de mida s+1 per a codis Z4-lineals de Hadamard i de Kerdock que satisfan el segon criteri. Finalment, s'han desenvolupat noves funcions en MAGMA, basades en els resultats obtinguts en aquesta tesis, per treballar amb la descodificació per permutacions per a codis lineals sobre cossos finits i codis Z4-lineals. De la mateixa forma, s'han desenvolupat noves funcions per treballar amb altres mètodes de descodificació adequats per a codis Z4-lineals.The hardest problem in the process of transmitting information is decoding. One of the major areas of research in coding theory is to find efficient decoding algorithms. Permutation decoding is a technique that strongly depends on the existence of a special subset, called a PD-set, of the permutation automorphism group of a code to assist in decoding received vectors. Recently, a new permutation decoding method suitable for Z4-linear codes was introduced. This dissertation aims to provide s-PD-sets, which enable the correction of up to s errors, for some families of Z4-linear codes to perform permutation decoding. We give upper bounds on s for which s-PD-sets of minimum size s+1 for systematic Hadamard and Kerdock codes can exist. Two different criteria to find s-PD-sets of size s+1 for Z4-linear codes are provided. Explicit and recursive constructions of s-PD-sets of size s+1 for binary linear and Z4-linear Hadamard codes fulfilling the first criterion are presented. Likewise, we show explicit constructions of s-PD-sets of size s+1 for Z4-linear Hadamard and Kerdock codes satisfying the second criterion. Finally, new MAGMA functions to deal with permutation decoding for linear codes over finite fields and Z4-linear codes, among other suitable decoding methods for Z4-linear codes, have been developed based on the results given in this dissertation.
19
Suárez, Canedo Emilio J. "Hadamard full propelinear codes of type Q. Rank and Kernel." Doctoral thesis, Universitat Autònoma de Barcelona, 2018. http://hdl.handle.net/10803/463039.
Full textAbstract:
Los sistemas de comunicación se nutren de técnicas algebraicas y combinat
óricas para recuperar la información en presencia de ruído e interferencias.
Los códigos Hadamard constituyen una familia relevante en la teoría de
códigos y ellos han sido objeto de estudio desde el siglo XX, por cientí cos
como Turyn. Aunque estos códigos no son lineales en general, ellos poseen
propiedades algebraicas y combinatóricas que permiten codi car, transmitir
y decodi car un mensaje a través de un canal ruidoso. Los mecanismos más
potentes para construír códigos de Hadamard con una estructura de grupo
algebraico subyacente son: las matrices de Hadamard cocíclicias, los conjuntos
de diferencias relativas, los grupos de Hadamard y los códigos Hadamard
properlineales.
El propósito de esta tesis es explorar las propiedades algebraicas y combinat
óricas de una subfamilia de los códigos Hadamard properlineales, que
denominamos códigos Hadamard full properlineales. Nuestro primer objetivo
es estudiar las relaciones existentes y las conexiones entre los grupos
de Hadamard y los códigos Hadamard full properlineales. Además, en esta
nueva subfamilia de códigos encontramos estructuras full properlineales que
generan ciertas matrices de Hadamard no simétricas; en concreto, estamos
hablando de las familias que tienen asociado el grupo dicíclico Q8n y el grupo
Cn Q8. Estas matrices de Hadamard son conocidas como las matrices de
Williamson y las matrices de Ito. Para ayudar a decidir cuando dos códigos
son equivalentes usaremos dos invariantes de los códigos: el rango y la
dimensión del núcleo. Estos parámetros nos aportan información sobre los
códigos no lineales; a modo de ejemplo, son un indicador para ver cuánto
dista un código binario de ser lineal. Concretamente, estudiaremos el rango
y la dimensión del kernel de ambas familias y utilizaremos técnicas iteradas
que permiten crear códigos Hadamard full properlineales de mayor orden.Communication systems need algebraic and combinatorial techniques to recover information in the presence of noise and interference. Hadamard codes constitute an important family of error correcting codes and they have been studied, since 20th century, by authors like Turyn. Although this codes are nonlinear, in general, they possess optimal algebraic and combinatorial properties which allow to encode, transmit and decode a message through a noisy channel. The most powerful mechanisms to construct Hadamard codes with a subjacent group structure are cocyclic Hadamard matrices, relative difference sets, Hadamard groups and Hadamard propelinear codes. The aim of this thesis is to explore the algebraic and combinatorial properties of a subfamily of the Hadamard propelinear codes which we term Hadamard full propelinear codes. Firstly, we study the connections between Hadamard groups and Hadamard full propelinear codes. Inside the class of Hadamard full propelinear codes we find several group structures with nonsymmetric Hadamard matrices. This is the case of the families with a subjacent dicyclic group Q8n and a Cn X Q8 group which belong to the class of Ito Hadamard matrices and the classs of Williamson Hadamard matrices, respectively. To help deciding whether two binary codes are nonequivalent we make use of two invariants: the rank and the dimension of the kernel. These parameters provide additional information about the code; for instance, they measure how far is the code from being linear. Specifically, we study the rank and the dimension of the kernel of the aforementioned families of Hadamard full propelinear codes and we also give iterative techniques which allow us to construct Hadamard full propelinear codes of higher orders.
20
吳堉榕 and Yuk-yung Ng. "Cyclic menon difference sets, circulant hadamard matrices and barker sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31211823.
Full text
21
Kiwi, Marcos. "Probabilistically checkable proofs and the testing of Hadamard-like codes." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/10563.
Full text
22
Tuo, Mingguang, Min Liang, Jitao Zhang, and Hao Xin. "Time-Domain THz Near-Field Imaging Incorporating Hadamard Multiplexing Method." IEEE, 2016. http://hdl.handle.net/10150/622785.
Full textAbstract:
Photoconductive antenna (PCA) array based THz near-field imager incorporating Hadamard multiplexing method is developed in this work. By using a 2 × 2 dipole antenna array as the THz transmitter, the system signal-to-noise ratio (SNR) is demonstrated to be improved by a factor of 2 as the theory predicts. Additionally, a 2-D scanning of a metallic structure on a THz-transparent substrate (with a total scanning area of 1 × 1 mm2) is experimentally implemented. Correlation coefficient estimation is made afterwards to quantify the reconstructed image quality.
23
Wang, Zeying. "Skew Hadamard difference sets, strongly regular graphs and bent functions." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 127 p, 2009. http://proquest.umi.com/pqdweb?did=1654490981&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
24
Ng, Yuk-yung. "Cyclic menon difference sets, circulant hadamard matrices and barker sequences /." [Hong Kong] : University of Hong Kong, 1993. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13814291.
Full text
25
Hunt, David Stephen. "The quantization of linear gravitational perturbations and the Hadamard condition." Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3156/.
Full textAbstract:
The quantum field theory describing linear gravitational perturbations is important from a cosmological viewpoint, in particular when formulated on de Sitter spacetime, which is used in inflationary models. There is currently an ongoing controversy pertaining to the existence of a de Sitter invariant vacuum state for free gravitons. This thesis is a mathematically rigorous study of the theory and all constructions are performed in as general a setting as is possible, which allows us to then specialise to a particular spacetime when required. In particular, to study the case of de Sitter spacetime with a view to resolving the aforementioned controversy. The main results include the full construction of the classical phase space of the linearized Einstein system on a background cosmological vacuum spacetime, which includes proving when various gauge choices can be made. In particular, we prove that within a normal neighbourhood of any Cauchy surface, in a globally hyperbolic spacetime, one may pass to the synchronous gauge. We also consider the transverse-traceless gauge but show that there is a topological obstruction to achieving this, which rules out its general use. In constructing the phase space it is necessary to obtain a weakly non-degenerate symplectic product. We prove that this can be achieved for the case that the background spacetime admits a compact Cauchy surface by using results from the Arnowitt-Deser-Misner (ADM) formalism, specifically the initial data splittings due to Moncrief. The system is quantized using Dirac's prescription, which permits the construction of an algebra of observables consisting of gauge-invariant smeared fields. It is shown that this algebra satisfies a time-slice condition. Finally, the states of the system are considered: we formulate the Hadamard condition and show that the Fock vacuum in Minkowski spacetime satisfies this definition.
26
Doniak, Marcio Henrique. "Estudo da transformada de Walsh-Hadamard aplicada à transmissão OFDM." Florianópolis, SC, 2006. http://repositorio.ufsc.br/xmlui/handle/123456789/88735.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.Made available in DSpace on 2012-10-22T12:58:31Z (GMT). No. of bitstreams: 1 234083.pdf: 4014648 bytes, checksum: ca9aba14dc03d197a335d5be935d9af1 (MD5)
Esta dissertação apresenta um estudo da aplicação da Transformada de Walsh-Hadamard (WHT) em diferentes sistemas OFDM. Os sistemas avaliados envolvem a transmissão sem fio entre uma antena transmissora e uma receptora (sistema SISO), e duas antenas transmissoras e uma receptora (sistema MISO Alamouti). A WHT espalha o sinal de informação antes de ser modulado no sistema OFDM. Conseqüentemente, os efeitos de desvanecimento provocados pelos canais correspondentes a cada subportadora OFDM também são espalhados, resultando em uma condição de desvanecimento médio destes canais. Isto leva a um aumento da robustez dos canais das subportadoras que mais sofreram com a transmissão puramente OFDM, mas degrada a condição de desvanecimento das mais robustas. Para verificar esta característica da WHT e o ganho de desempenho que ela possa impactar ao sistema OFDM, foram realizadas simulações com sistemas OFDM com e sem o uso da WHT. Assim, foi possível avaliar o desempenho desta técnica nos
27
BUSSOLA, FRANCESCO. "Hadamard states and tunnelling effects for a BTZ black hole." Doctoral thesis, Università degli studi di Pavia, 2019. http://hdl.handle.net/11571/1244306.
Full textAbstract:
This thesis analyses the behaviour of a real massive scalar field in BTZ spacetime, a 2+1-dimensional black hole solution of the Einstein's field equations with a negative cosmological constant.
The analysis is performed for a large class of Robin boundary conditions that can be imposed at infinity and we show whether, for a given boundary condition, there exists a ground state by constructing explicitly its two-point function.
We demonstrate that, for a subclass of such boundary conditions, it is possible to construct a ground state that locally satisfies the Hadamard property.
In all other cases we show that bound state mode solutions exist, a novel feature in literature. Moreover we show that the presence of bound state mode solutions prevents the construction of a physically acceptable ground state.
Subsequently we focus our attention in a neighborhood of a Killing horizon in a 2+1-dimensional spacetime, so to analyse the local behaviour of the two-point correlation function of a quantum state for a scalar field.
In particular we show that, if the state is of Hadamard form in such neighbourhood, the two-point correlation function exhibits a thermal behaviour at the Hawking temperature, under a suitable scaling limit towards the horizon. This results are then specified to the case of a massive, real scalar field subject to Robin boundary conditions in the the non-extremal, rotating BTZ spacetime.
28
Cacais, Nieto Félix. "Compactificações diferenciáveis em espaços simétricos de tipo não compacto." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/159602.
Full textAbstract:
Neste trabalho estudaremos alguns resultados propostos por Benoit Kloe kner [Kl2] em sua tese de doutorado. Apresentamos prin ipalmente a prova da não-existência de compactificações diferenciáveis de Hadamard em espaços simétri os de tipo não- ompa to de posto k ≥ 2.In this dissertation we will study some results proposed by Benoit Kloe kner [Kl2] in his do toral thesis. We mainly present the proof of non-existen e of diferentiable Hadamard compactific ations in symmetric spaces of non compact type of rank ≥ 2.
29
Cheang, Ka Hang. "Two problems on inverse eigenvalue problems and Hadamard finite part integrals." Thesis, University of Macau, 2010. http://umaclib3.umac.mo/record=b2182891.
Full text
30
Spyrou, Spyros. "Linear block codes for block fading channels based on Hadamard matrices." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3136.
Full textAbstract:
We investigate the creation of linear block codes using Hadamard matrices for block
fading channels. The aforementioned codes are very easy to find and have bounded
cross correlation spectrum. The optimality is with respect to the metric-spectrum
which gives a performance for the codes very close to optimal codes. Also, we can
transform these codes according to different characteristics of the channel and can
use selective transmission methods.
31
Silva, Henrique Eduardo Bezerra da. "Desenvolvimento de um espectrofometro no infravermelho proximo com transformada de Hadamard." [s.n.], 1999. http://repositorio.unicamp.br/jspui/handle/REPOSIP/249954.
Full textAbstract:
Orientador: Celio PasquiniTese (doutorado) - Universidade Estadual de Campinas, Instituto de Quimica
Made available in DSpace on 2018-08-12T03:06:28Z (GMT). No. of bitstreams: 1 Silva_HenriqueEduardoBezerrada_D.pdf: 4516088 bytes, checksum: b0d96759802609f071fcbdc46d237a13 (MD5) Previous issue date: 1999
Doutorado
32
Costa, Maria Silvana Alcantara. "Sobre subvariedades com segunda forma fundamental dominada em espaÃos de Hadamard." Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=722.
Full textAbstract:
Nosso trabalho tem como objeto de estudo subvariedades em espaÃos de Hadamard e em espaÃos produto NÃR onde N Ã uma variedade Riemanniana completa com pÃlo e curvaturas seccionais radiais limitadas superiormente.
Em espaÃos de Hadamard mostramos que imersÃes com norma da segunda forma fundamental dominada sÃo prÃprias e tem topologia finita. As subvariedades do espaÃo Euclideano com essa condiÃÃo sobre a segunda forma fundamental tem tom fundamental nulo.
Sobre o espaÃo produto N à R, inicialmente estudamos hipersuperfÃcies imersas contidas em um cilindro vertical. Observamos que, a partir de uma certa limitaÃÃo no vetor curvatura mÃdia, estas hipersuperfcies sÃo nÃo parabÃlicas. Outro resultado obtido à a nÃo existÃncia de hipersuperfÃcies completas imersas em Hn à R com curvatura de Ricci com decaimento superquadrÃtico, RicM −c2 [1 + M(x)2 â log2(M(x) + 2)] e curvatura mÃdia
com sup |H| < (n − 1)/n contidas em um cilindro vertical. Para subvariedades
mÃnimas M N Ã R de dimensÃo m mostramos que o tom fundamental
de domÃnios limitados M satisfaz a seguinte desigualdade
( ) 1(BNm−1(_)(r)), onde BNm−1( )(r) Ã a bola geodÃsica das Formas
Espaciais Nm−1() de dimensÃo (m − 1) e curvatura seccional constante .
33
Vela, Cabello Carlos. "On Z₂s-linear Hadamard codes and their classification using the rank and kernel." Doctoral thesis, Universitat Autònoma de Barcelona, 2018. http://hdl.handle.net/10803/665403.
Full textAbstract:
Els codis Z₂s-additius són subgrups de l'anell Zn2s i poden considerar-se com una generalització dels codis lineals sobre Z₂ i Z₄. Es diu codi Hadamard Z₂s - lineal a un codi binari Hadamard que és la imatge, via l'aplicació de Gray, d'un Z₂s-additiu. Està demostrat que per donar una classificació completa dels codis Hadamard Z₄-lineals es pot usar el rang o la dimensió del nucli. L'objectiu d'aquesta tesi és classificar la família dels codis Hadamard Z₂s - lineals obtinguda a través de l'aplicació de Gray generalitzada definida per Carlet, usant el rang i la dimensió del nucli. Primer, donem una construcció recursiva de les matrius generadores dels codis Hadamard Z₂s-additius corresponents. Gràcies a aquesta construcció, donem una demostració nova de que les imatges, via l'aplicació de Gray generalitzada, dels codis generats són Hadamard. Construïm el nucli dels codis Hadamard Z₂s -lineals de longitud 2ᵗ per a s > 2 , obtenim la seva dimensió i la usem per obtenir una classificació parcial d'aquests codis. A continuació, donem el rang d'aquests codis per a s = 3 i demostrem que, juntament amb la dimensió del nucli, podem obtenir una classificació completa dels codis Hadamard Z₈-lineals, fixant t ≥ 3. També, per a s = 3, establim la quantitat exacta de codis no equivalents d'aquest tipus. Finalment, provem que algunes famílies de codis Hadamard Z₂s -lineals de longitud 2ᵗ són equivalents fixant t ≥ 3. Això ens permet millorar els resultats anteriors relacionats amb la classificació parcial. També donem cotes superiors i inferiors per a la quantitat de codis Hadamard Z₂s -lineals no equivalents de longitud 2ᵗ. Més encara, calculem la quantitat exacta de codis no equivalents fins a t = 11.Los códigos Z₂s-aditivos son subgrupos del anillo Zn2 s y pueden considerarse como una generalización de los códigos lineales sobre Z₂ y Z₄. Se llama código Hadamard Z₂s -lineal a un código binario Hadamard que es la imagen, vía la aplicación de Gray, de uno Z₂s-aditivo. Está demostrado que para dar una clasificación completa de los códigos Hadamard Z₄-lineales se puede usar el rango o la dimensión del núcleo. El objetivo de esta tesis es clasificar la familia de los códigos Hadamard Z₂s -lineales obtenida a través de la aplicación de Gray generalizada definida por Carlet, usando el rango y la dimensión del núcleo. Primero, damos una construcción recursiva de las matrices generadoras de los códigos Hadamard aditivos sobre Z₂s correspondientes. Gracias a esta construcción, damos una demostración nueva de que las imagenes, vía la aplicación de Gray generalizada, de los códigos generados son Hadamard. Construimos el núcleo de los códigos Hadamard Z₂s -lineales de longitud 2ᵗ para s > 2 , obtenemos su dimensión y la usamos para obtener una clasificación parcial de estos códigos. A continuación, damos el rango de estos códigos para s = 3 y demostramos que, junto con la dimensión del núcleo, podemos obtener una clasificación completa de los códigos Hadamard Z₈-lineales, fijando t ≥ 3. También, para s = 3, establecemos la can- tidad exacta de códigos no equivalentes de este tipo. Por último, probamos que algnas familias de códigos Hadamard Z₂s -lineales de longitud 2ᵗ son equivalentes fijando t ≥ 3. Esto nos permite mejorar los resultados anteriores relacionados con la clasificación parcial. También damos cotas superiores e inferiores para la cantidad de códigos Hadamard Z₂s -lineales no equivalentes de longitud 2ᵗ. Más aún, calculamos la cantidad exacta de códigos no equivalentes hasta t = 11.
The Z₂s-additive codes are subgroups of Zn2 s , and can be seen as a general- ization of linear codes over Z₂ and Z₄. A Z₂s -linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z₂s-additive code. It is known that either the rank or the dimension of the kernel can be used to give a complete classification for the Z₄-linear Hadamard codes. The aim of this thesis is to classify the family of Z₂s -linear Hadamard codes obtained from the Carlet's generalized Gray map through the rank and di- mension of the kernel. First, we give a recursive construction of the generator matrices of the corresponding Z₂s-additive Hadamard codes. By using this con- struction, we present a new proof to show that the generated codes are indeed Hadamard. The kernel of these Z₂s -linear Hadamard codes of length 2ᵗ and its dimension are established for any s > 2, and it allows to give a partial classifica- tion of such codes. Moreover, we prove that this invariant provides a complete classification for some values of t and s. Later, the rank of these codes is com- puted for s = 3, and it is proved that this invariant, along with the dimension of the kernel, provides a complete classification for Z₈-linear Hadamard codes, once t ≥ 3 is fixed. In this case, the number of nonequivalent such codes is also established. Finally, we prove that some families of Z₂s -linear Hadamard codes of length 2ᵗ are equivalent, once t is fixed. This allows us to improve the previous results on the partial classification of these codes. An upper and a lower bound are given for the amount of nonequivalent Z₂s -linear Hadamard codes of length 2ᵗ. Moreover, after some computations, the exact amount of nonequivalent such codes of length 2ᵗ up to t = 11 is found.
34
Behbahani, Majid, and University of Lethbridge Faculty of Arts and Science. "On orthogonal matrices." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2004, 2004. http://hdl.handle.net/10133/213.
Full textAbstract:
Our main aim in this thesis is to study and search for orthogonal matrices which have a certain kind of block structure. The most desirable class of matrices for our purpose are orthogonal designs constructible from 16 circulant matrices. In studying these matrices, we show that the OD (12;1,1,1,9) is the only orthogonal design constructible from 16 circulant matrices of type OD (4n;1,1,1,4n-3), whenever n > 1 is an odd integer. We then use an exhaustive search to show that the only orthogonal design constructible from 16 circulant matrices of order 12 on 4 variables is the OD (12;1,1,1,9). It is known that by using of T-matrices and orthogonal designs constructible from 16 circulant matrices one can produce an infinite family of orthogonal designs. To complement our studies we reproduce and important recent construction of T-matrices by Xia and Xia. We then turn our attention to the applications of orthogonal matices. In some recent works productive regular Hadamard matrices are used to construct many new infinite families of symmetric designs. We show that for each integer n for which 4n is the order of a Hadamard matrix and 8n2 - 1 is a prime, there is a productive regular Hadamard matrix of order 16n2(82-1)2. As a corollary, we get many new infinite classes of symmetric designs whenever either of 4n(8n2-1)-1,4n(82-1) +1 is a prime power. We also review some other constructions of productive regular Hadamard matrices which are related to our work.iv, 64 leaves : ill., map ; 29 cm.
35
Haebel, Sophie. "Front-end-resolution and hadamard transform in fourier transform ion cyclotron resonance /." [S.l.] : [s.n.], 1993. http://library.epfl.ch/theses/?display=detail&nr=1132.
Full text
36
Law, Ieng Chi. "Equality cases for some inequalities involving the Hadamard product of Hermitian matrices." Thesis, University of Macau, 2001. http://umaclib3.umac.mo/record=b1446714.
Full text
37
Heusler, Stefan [Verfasser]. "Universal Spectral Fluctuations in the Hadamard-Gutzwiller model and beyond / Stefan Heusler." Aachen : Shaker, 2004. http://d-nb.info/1172608792/34.
Full text
38
Pohlen, Timo [Verfasser], and Jürgen [Akademischer Betreuer] Müller. "The Hadamard product and universal power series / Timo Pohlen ; Betreuer: Jürgen Müller." Trier : Universität Trier, 2009. http://d-nb.info/1197805079/34.
Full text
39
Mesquita, Raul Rabello. "Fórmulas Variacionais tipo Hadamard para os Autovalores do Eta-laplaciano e Aplicações." Universidade Federal do Amazonas - Universidade Federal do Pará, 2014. http://tede.ufam.edu.br/handle/tede/5367.
Full textAbstract:
Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-12-13T15:18:50Z
No. of bitstreams: 1
Tese - Raul R. Mesquita.pdf: 2035561 bytes, checksum: c90ee83b92d4f8ba8b3d878144474d4a (MD5)Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-12-13T15:19:04Z (GMT) No. of bitstreams: 1 Tese - Raul R. Mesquita.pdf: 2035561 bytes, checksum: c90ee83b92d4f8ba8b3d878144474d4a (MD5)
Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-12-13T15:19:21Z (GMT) No. of bitstreams: 1 Tese - Raul R. Mesquita.pdf: 2035561 bytes, checksum: c90ee83b92d4f8ba8b3d878144474d4a (MD5)
Made available in DSpace on 2016-12-13T15:19:21Z (GMT). No. of bitstreams: 1 Tese - Raul R. Mesquita.pdf: 2035561 bytes, checksum: c90ee83b92d4f8ba8b3d878144474d4a (MD5) Previous issue date: 2014-07-11
FAPEAM - Fundação de Amparo à Pesquisa do Estado do Amazonas
In this thesis we consider an analytic family of Riemannian structures on a compact smooth manifold M with boundary. We impose the Dirichlet condition to the Eta-Laplacian and proof the existence of analytic curves of its eigenfunctions and eigenvalues. We next derive Hadamard type variation formulas. As a first application of these formulas we obtain that there is a residual subset of the set of metrics where all eigenvalues of the Eta-Laplacian operator are generically simple. We consider a bounded domain 12 in M. Then we show that the subset of diffeomorphisms in 12 is residual provided the eigenvalues of the Eta-laplacian are simple. As another application we obtain variational expressions of the eigenvalues in the case when the metric varies conformally. We conclude our work with analysis of the behaviour of the eigenvalues of Eta-laplacian along the Ricci flow.
Neste trabalho consideramos uma família analítica de estruturas riemannianas em uma variedade diferenciável M com bordo. Impomos a condição de bordo de Dirichlet ao Eta-laplaciano e mostramos a existência de curvas analíticas de seus autovalores e autofunções. Deduzimos fórmulas variacionais tipo Hadamard. Como primeira aplicação mostramos que existe um subconjunto residual do conjunto das métricas, para o qual todos os autovalores do Eta-laplaciano são genericamente simples. Consideramos ainda um domínio limitado em M, e então mostramos que o subconjunto de difeomorfismos do domínio onde os autovalores do Eta-laplaciano são simples, é residual. Em uma segunda aplicação obtemos, para o Eta-laplaciano, expressões variacionais para os autovalores quando a variação da métrica é conforme. Por fim, é feita uma análise do comportamento dos autovalores do ij-laplaciano ao longo do fluxo de Ricci, onde eventualmente se tem a suavidade da respectiva autofunção.
40
Batista, Edvaldo Elias de Almeida. "Generalized vector equilibrium problems and algorithms for variational inequality in hadamard manifolds." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6562.
Full textAbstract:
Submitted by Jaqueline Silva (jtas29@gmail.com) on 2016-12-09T17:10:49Z
No. of bitstreams: 2
Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-09T17:11:03Z (GMT) No. of bitstreams: 2 Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2016-12-09T17:11:03Z (GMT). No. of bitstreams: 2 Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-10-20
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
In this thesis, we study variational inequalities and generalized vector equilibrium problems. In Chapter 1, several results and basic definitions of Riemannian geometry are listed; we present the concept of the monotone vector field in Hadamard manifolds and many of their properties, besides, we introduce the concept of enlargement of a monotone vector field, and we display its properties in a Riemannian context. In Chapter 2, an inexact proximal point method for variational inequalities in Hadamard manifolds is introduced, and its convergence properties are studied; see [7]. To present our method, we generalize the concept of enlargement of monotone operators, from a linear setting to the Riemannian context. As an application, an inexact proximal point method for constrained optimization problems is obtained. In Chapter 3, we present an extragradient algorithm for variational inequality associated with the point-to-set vector field in Hadamard manifolds and study its convergence properties; see [8]. In order to present our method, the concept of enlargement of maximal monotone vector fields is used and its lower-semicontinuity is established to obtain the convergence of the method in this new context. In Chapter 4, we present a sufficient condition for the existence of a solution to the generalized vector equilibrium problem on Hadamard manifolds using a version of the KnasterKuratowski-Mazurkiewicz Lemma; see [6]. In particular, the existence of solutions to optimization, vector optimization, Nash equilibria, complementarity, and variational inequality is a special case of the existence result for the generalized vector equilibrium problem.
Nesta tese, estudamos desigualdades variacionais e o problema de equilíbrio vetorial generalizado. No Capítulo 1, vários resultados e definições elementares sobre geometria Riemanniana são enunciados; apresentamos o conceito de campo vetorial monótono e muitas de suas propriedades, além de introduzir o conceito de alargamento de um campo vetorial monótono e exibir suas propriedades em um contexto Riemanniano. No Capítulo 2, um método de ponto proximal inexato para desigualdades variacionais em variedades de Hadamard é introduzido e suas propriedades de convergência são estudadas; veja [7]. Para apresentar o nosso método, generalizamos o conceito de alargamento de operadores monótonos, do contexto linear ao contexto de Riemanniano. Como aplicação, é obtido um método de ponto proximal inexato para problemas de otimização com restrições. No Capítulo 3, apresentamos um algoritmo extragradiente para desigualdades variacionais associado a um campo vetorial ponto-conjunto em variedades de Hadamard e estudamos suas propriedades de convergência; veja [8]. A fim de apresentar nosso método, o conceito de alargamento de campos vetoriais monótonos é utilizado e sua semicontinuidade inferior é estabelecida, a fim de obter a convergência do método neste novo contexto. No Capítulo 4, apresentamos uma condição suficiente para a existência de soluções para o problema de equilíbrio vetorial generalizado em variedades de Hadamard usando uma versão do Lema Knaster-Kuratowski-Mazurkiewicz; veja [6]. Em particular, a existência de soluções para problemas de otimização, otimização vetorial, equilíbrio de Nash, complementaridade e desigualdades variacionais são casos especiais do resultado de existência do problema de equilíbrio vetorial generalizado.
41
CALUSSI, GABRIELE. "Hadamard products of varieties." Doctoral thesis, 2019. http://hdl.handle.net/2158/1149641.
Full text
42
Fothergill, Daryl William. "A prototype Hadamard imaging system." 2005. http://www.lib.ncsu.edu/theses/available/etd-09062005-183934/unrestricted/etd.pdf.
Full text
43
Livinskyi, Ivan. "Asymptotic existence of Hadamard matrices." 2012. http://hdl.handle.net/1993/8915.
Full text
44
Haung, Yu-Shi, and 黃育詩. "Some Inequalities Of Hadamard Type." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/84271735725365649767.
Full text
45
Huang, Wei-Chou, and 黃維洲. "SOME refinements of Hadamard Inequality." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/23036128697005064659.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
103
If f : I → ℝ is convex on I, then f( (a+b)/2)≤1/(b-a ) ∫_a^b▒〖f(x)dx ≤ 1/(2 ) [f(a)+f(b)] 〗 (1.1) This is the classical Hermite-Hadamard inequality If f is a convex function on I , do there exist real numbers l , L such that f((a+b)/2)≤ l ≤1/(b-a ) ∫_a^b▒〖f(x)dx ≤L ≤ 1/(2 ) [f(a)+f(b)] 〗 (1.2) The main purpose of this paper is to give some answers to the question (1.2)
46
Ku, Hao-Chang, and 古皓彰. "Several refinements of Hadamard inequality." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/06966273601391822071.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
103
If f : I → ℝ is convex on I, then f((a+b)/2)≤1/(b-a ) ∫_a^b▒〖f(x)dx ≤ 1/(2 ) [f(a)+f(b)] 〗 (1.1) This is the classical Hermite-Hadamard inequality If f is a convex function on I , do there exist real numbers l , L such that f((a+b)/2)≤ l ≤1/(b-a ) ∫_a^b▒〖f(x)dx ≤L ≤ 1/(2 ) [f(a)+f(b)] 〗 (1.2) The main purpose of this paper is to give more answers to the question (1.2)
47
Luo, Wen-Horng, and 羅文宏. "On refinements of Hadamard inequality." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/69676147210926526716.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
103
The main purpose of this paper establish some new inequalities related to the Hermite-Hadamard’s inequality . It is to give more answers to the question (1.2)
48
Ting, Hsiang-Sheng, and 丁祥生. "Refinements of Hermite-Hadamard inequality." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/kh58pk.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
105
If f is convex function on [a,b],do there exist real numbers k,K,such that between the classic Hermite-Hadamard inequality? The main purpose of this paper is to give more answers to the question.
49
Hung, Jui-Tse, and 洪睿澤. "More refinements of Hadamard Inequality." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/48407238751464681489.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
104
If f is convex function on [a,b],do there exist real numbers l,L,such that between the classic Hermite-Hadamard inequality? The main purpose of this paper is to give more answers to the question.
50
Wang, Carlem, and 王清正. "Refinements of Hermite-Hadamard inequality." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/33532866028030342389.
Full textAbstract:
碩士淡江大學
中等學校教師在職進修數學教學碩士學位班
104
If f is convex function on [a,b],do there exist real numbers k,K,such that between the classic Hermite-Hadamard inequality? The main purpose of this paper is to give more answers to the question.