Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Subdivision (4)
- Curve design (3)
- Refinable functions (3)
- A-ary (2)
- Computer-aided geometric design (2)
-
- Stationary (2)
- Algebra (1)
- Algorithm (1)
- Algorithms (1)
- Analysis (1)
- Analytic Geometry (1)
- Bernoulli (1)
- Biarc (1)
- Boundary value problem (1)
- Circular-Invariant (1)
- Cohomology (1)
- Complexity (1)
- Constrained optimization (1)
- Cyberspace operations (Military science) (1)
- Cyberterrorism (1)
- Data sparsity (1)
- Decay-growth problem (1)
- Derivative (1)
- Differential Geometry (1)
- Dirichlet’s formula (1)
- Eigenvalue problem (1)
- Exponential kernels (1)
- Factorization (1)
- Faulhaber (1)
- Finite element method on surfaces (1)
- Publication
-
- Applications and Applied Mathematics: An International Journal (AAM) (5)
- Mathematical Sciences Spring Lecture Series (2)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
- Department of Mathematics Facuty Scholarship and Creative Works (1)
- Electronic Theses, Projects, and Dissertations (1)
- Publication Type
Articles 1 - 16 of 16
Full-Text Articles in Algebraic Geometry
Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova
Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova
Journal of Humanistic Mathematics
This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Mathematical Sciences Spring Lecture Series
As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Mathematical Sciences Spring Lecture Series
Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Electronic Theses, Projects, and Dissertations
In Calculus we learned that Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
We examine two dimensional properties of vortex shedding past elliptical cylinders through numerical simulations. Specifically, we investigate the vortex formation length in the Reynolds number regime 10 to 100 for elliptical bodies of aspect ratio in the range 0.4 to 1.4. Our computations reveal that in the steady flow regime, the change in the vortex length follows a linear profile with respect to the Reynolds number, while in the unsteady regime, the time averaged vortex length decreases in an exponential manner with increasing Reynolds number. The transition in profile is used to identify the critical Reynolds number which marks the …
Analyzing Network Topology For Ddos Mitigation Using The Abelian Sandpile Model, Bhavana Panchumarthi, Monroe Ame Stephenson
Analyzing Network Topology For Ddos Mitigation Using The Abelian Sandpile Model, Bhavana Panchumarthi, Monroe Ame Stephenson
altREU Projects
A Distributed Denial of Service (DDoS) is a cyber attack, which is capable of triggering a cascading failure in the victim network. While DDoS attacks come in different forms, their general goal is to make a network's service unavailable to its users. A common, but risky, countermeasure is to blackhole or null route the source, or the attacked destination. When a server becomes a blackhole, or referred to as the sink in the paper, the data that is assigned to it "disappears" or gets deleted. Our research shows how mathematical modeling can propose an alternative blackholing strategy that could improve …
Numerical Solution For Solving Two-Points Boundary Value Problems Using Orthogonal Boubaker Polynomials, Imad Noah Ahmed
Numerical Solution For Solving Two-Points Boundary Value Problems Using Orthogonal Boubaker Polynomials, Imad Noah Ahmed
Emirates Journal for Engineering Research
In this paper, a new technique for solving boundary value problems (BVPs) is introduced. An orthogonal function for Boubaker polynomial was utilizedand by the aid of Galerkin method the BVP was transformed to a system of linear algebraic equations with unknown coefficients, which can be easily solved to find the approximate result. Some numerical examples were added with illustrations, comparing their results with the exact to show the efficiency and the applicability of the method.
Calculating The Cohomology Of A Lie Algebra Using Maple And The Serre Hochschild Spectral Sequence, Jacob Kullberg
Calculating The Cohomology Of A Lie Algebra Using Maple And The Serre Hochschild Spectral Sequence, Jacob Kullberg
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Lie algebra cohomology is an important tool in many branches of mathematics. It is used in the Topology of homogeneous spaces, Deformation theory, and Extension theory. There exists extensive theory for calculating the cohomology of semi simple Lie algebras, but more tools are needed for calculating the cohomology of general Lie algebras. To calculate the cohomology of general Lie algebras, I used the symbolic software program called Maple. I wrote software to calculate the cohomology in several different ways. I wrote several programs to calculate the cohomology directly. This proved to be computationally expensive as the number of differential forms …
Application And Evaluation Of Lighthouse Technology For Precision Motion Capture, Soumitra Sitole
Application And Evaluation Of Lighthouse Technology For Precision Motion Capture, Soumitra Sitole
Masters Theses
This thesis presents the development towards a system that can capture and quantify motion for applications in biomechanical and medical fields demanding precision motion tracking using the lighthouse technology. Commercially known as SteamVR tracking, the lighthouse technology is a motion tracking system developed for virtual reality applications that makes use of patterned infrared light sources to highlight trackers (objects embedded with photodiodes) to obtain their pose or spatial position and orientation. Current motion capture systems such as the camera-based motion capture are expensive and not readily available outside of research labs. This thesis provides a case for low-cost motion capture …
Projected Surface Finite Elements For Elliptic Equations, Necibe Tuncer
Projected Surface Finite Elements For Elliptic Equations, Necibe Tuncer
Applications and Applied Mathematics: An International Journal (AAM)
In this article, we define a new finite element method for numerically approximating solutions of elliptic partial differential equations defined on “arbitrary” smooth surfaces S in RN+1. By “arbitrary” smooth surfaces, we mean surfaces that can be implicitly represented as level sets of smooth functions. The key idea is to first approximate the surface S by a polyhedral surface Sh, which is a union of planar triangles whose vertices lie on S; then to project Sh onto S. With this method, we can also approximate the eigenvalues and eigenfunctions of th Laplace-Beltrami operator on these “arbitrary” surfaces.
Propeller, Joel Kahn
Propeller, Joel Kahn
The STEAM Journal
This image is based on several different algorithms interconnected within a single program in the language BASIC-256. The fundamental structure involves a tightly wound spiral working outwards from the center of the image. As the spiral is drawn, different values of red, green and blue are modified through separate but related processes, producing the changing appearance. Algebra, trigonometry, geometry, and analytic geometry are all utilized in overlapping ways within the program. As with many works of algorithmic art, small changes in the program can produce dramatic alterations of the visual output, which makes lots of variations possible.
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
A 4-point nonlinear corner-cutting subdivision scheme is established. It is induced from a special C-shaped biarc circular spline structure. The scheme is circular-invariant and can be effectively applied to 2-dimensional (2D) data sets that are locally convex. The scheme is also extended adaptively to non-convex data. Explicit examples are demonstrated.
Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang
Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang
Applications and Applied Mathematics: An International Journal (AAM)
Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …
Fractional Calculus: Definitions And Applications, Joseph M. Kimeu
Fractional Calculus: Definitions And Applications, Joseph M. Kimeu
Masters Theses & Specialist Projects
No abstract provided.
On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian
On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
The a-ary 3-point and 5-point interpolatery subdivision schemes for curve design are introduced for arbitrary odd integer a greater than or equal to 3. These new schemes further extend the family of the classical 4- and 6-point interpolatory schemes.
On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian
On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
The classical binary 4-point and 6-point interpolatery subdivision schemes are generalized to a-ary setting for any integer a greater than or equal to 3. These new a-ary subdivision schemes for curve design are derived easily from their corresponding two-scale scaling functions, a notion from the context of wavelets.