Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Computation Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Prairie View A&M University (37)
- University of Dar es Salaam (18)
- Southern Methodist University (13)
- Illinois State University (12)
- Singapore Management University (12)
-
- Embry-Riddle Aeronautical University (6)
- University of Nevada, Las Vegas (6)
- Binghamton University (5)
- Claremont Colleges (5)
- Dartmouth College (5)
- University of Kentucky (5)
- California Polytechnic State University, San Luis Obispo (4)
- Georgia Southern University (4)
- Old Dominion University (4)
- The University of Southern Mississippi (4)
- University of Nebraska - Lincoln (4)
- Murray State University (3)
- New Jersey Institute of Technology (3)
- Technological University Dublin (3)
- The University of Akron (3)
- University of Arkansas, Fayetteville (3)
- University of New Mexico (3)
- East Tennessee State University (2)
- Karbala International Journal of Modern Science (2)
- Kennesaw State University (2)
- Loyola University Chicago (2)
- Michigan Technological University (2)
- University of Louisville (2)
- University of North Florida (2)
- University of South Carolina (2)
- Keyword
-
- Machine Learning (9)
- Machine learning (8)
- Neural Networks (5)
- Simulation (5)
- Breakdown (4)
-
- Computer Science (4)
- Deep learning (4)
- Subdivision (4)
- Bernoulli feedback (3)
- Cryptography (3)
- Curve design (3)
- Deep Learning (3)
- Feedback (3)
- Multiple vacation (3)
- Optimization (3)
- Refinable functions (3)
- Repair (3)
- A-ary (2)
- Abandonment (2)
- Algorithms (2)
- Applied Mathematics (2)
- Applied sciences (2)
- Artificial intelligence (2)
- Batch arrival (2)
- Bernoulli vacation (2)
- Bulk service (2)
- Bulking (2)
- Calculus of variations (2)
- Call center (2)
- Casino floor optimization (2)
- Publication Year
- Publication
-
- Applications and Applied Mathematics: An International Journal (AAM) (37)
- Tanzania Journal of Engineering and Technology (TJET) (18)
- Research Collection School Of Computing and Information Systems (12)
- Annual Symposium on Biomathematics and Ecology Education and Research (11)
- Mathematics Theses and Dissertations (7)
-
- Dissertations (6)
- Northeast Journal of Complex Systems (NEJCS) (5)
- Dartmouth College Master’s Theses (4)
- SMU Data Science Review (4)
- Theses and Dissertations (4)
- College of Graduate Studies: Theses & Dissertations (3)
- Electronic Theses and Dissertations (3)
- International Conference on Gambling & Risk Taking (3)
- Master's Theses (3)
- Publications (3)
- Theses and Dissertations--Mathematics (3)
- Williams Honors College, Honors Research Projects (3)
- Computer Science: Faculty Publications and Other Works (2)
- Conference papers (2)
- Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023– (2)
- Dissertations, Master's Theses and Master's Reports (2)
- Doctoral Dissertations and Master's Theses (2)
- Honors College Theses (2)
- Journal of Humanistic Mathematics (2)
- Karbala International Journal of Modern Science (2)
- Mathematical Sciences Spring Lecture Series (2)
- Mathematics & Statistics ETDs (2)
- Mathematics Research (2)
- Murray State Theses and Dissertations (2)
- STAR Program Research Presentations (2)
- Publication Type
- File Type
Articles 151 - 180 of 215
Full-Text Articles in Numerical Analysis and Computation
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Murray State Theses and Dissertations
We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …
A Physics-Based Approach To Modeling Wildland Fire Spread Through Porous Fuel Beds, Tingting Tang
A Physics-Based Approach To Modeling Wildland Fire Spread Through Porous Fuel Beds, Tingting Tang
Theses and Dissertations--Mechanical and Aerospace Engineering
Wildfires are becoming increasingly erratic nowadays at least in part because of climate change. CFD (computational fluid dynamics)-based models with the potential of simulating extreme behaviors are gaining increasing attention as a means to predict such behavior in order to aid firefighting efforts. This dissertation describes a wildfire model based on the current understanding of wildfire physics. The model includes physics of turbulence, inhomogeneous porous fuel beds, heat release, ignition, and firebrands. A discrete dynamical system for flow in porous media is derived and incorporated into the subgrid-scale model for synthetic-velocity large-eddy simulation (LES), and a general porosity-permeability model is …
Long And Short-Range Air Navigation On Spherical Earth, Nihad E. Daidzic
Long And Short-Range Air Navigation On Spherical Earth, Nihad E. Daidzic
International Journal of Aviation, Aeronautics, and Aerospace
Global range air navigation implies non-stop flight between any two airports on Earth. Such effort would require airplanes with the operational air range of at least 12,500 NM which is about 40-60% longer than anything existing in commercial air transport today. Air transportation economy requires flying shortest distance, which in the case of spherical Earth are Orthodrome arcs. Rhumb-line navigation has little practical use in long-range flights, but has been presented for historical reasons and for comparison. Database of about 50 major international airports from every corner of the world has been designed and used in testing and route validation. …
Non Markovian Queue With Two Types Service Optional Re-Service And General Vacation Distribution, K. Sathiya, G. Ayyappan
Non Markovian Queue With Two Types Service Optional Re-Service And General Vacation Distribution, K. Sathiya, G. Ayyappan
Applications and Applied Mathematics: An International Journal (AAM)
We consider a single server batch arrival queueing system, where the server provides two types of heterogeneous service. A customer has the option of choosing either type 1 service with probability p1 or type 2 service with probability p2 with the service times follow general distribution. After the completion of either type 1 or type 2 service a customer has the option to repeat or not to repeat the type 1 or type 2 service. As soon as the customer service is completed, the server will take a vacation with probability θ or may continue staying in the system with …
An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger
An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger
Electronic Theses and Dissertations
Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R3, but also to the general case of finding minimal functionals on hypersurfaces in Rn associated with an arbitrary metric.
Optimizing The Mix Of Games And Their Locations On The Casino Floor, Jason D. Fiege, Anastasia D. Baran
Optimizing The Mix Of Games And Their Locations On The Casino Floor, Jason D. Fiege, Anastasia D. Baran
International Conference on Gambling & Risk Taking
We present a mathematical framework and computational approach that aims to optimize the mix and locations of slot machine types and denominations, plus other games to maximize the overall performance of the gaming floor. This problem belongs to a larger class of spatial resource optimization problems, concerned with optimizing the allocation and spatial distribution of finite resources, subject to various constraints. We introduce a powerful multi-objective evolutionary optimization and data-modelling platform, developed by the presenter since 2002, and show how this software can be used for casino floor optimization. We begin by extending a linear formulation of the casino floor …
Stationary And Time-Dependent Optimization Of The Casino Floor Slot Machine Mix, Anastasia D. Baran, Jason D. Fiege
Stationary And Time-Dependent Optimization Of The Casino Floor Slot Machine Mix, Anastasia D. Baran, Jason D. Fiege
International Conference on Gambling & Risk Taking
Modeling and optimizing the performance of a mix of slot machines on a gaming floor can be addressed at various levels of coarseness, and may or may not consider time-dependent trends. For example, a model might consider only time-averaged, aggregate data for all machines of a given type; time-dependent aggregate data; time-averaged data for individual machines; or fully time dependent data for individual machines. Fine-grained, time-dependent data for individual machines offers the most potential for detailed analysis and improvements to the casino floor performance, but also suffers the greatest amount of statistical noise. We present a theoretical analysis of single …
Color Image Encryption And Decryption Using Hill Cipher Associated With Arnold Transform, Rakesh Ranjan, R. K. Sharma, M. Hanmandlu
Color Image Encryption And Decryption Using Hill Cipher Associated With Arnold Transform, Rakesh Ranjan, R. K. Sharma, M. Hanmandlu
Applications and Applied Mathematics: An International Journal (AAM)
Image security over open network transmission is a big concern nowadays. This paper proposes another methodology for color image encoding and decoding using two stage Hill Cipher method which is connected with Arnold Transformation. The forgoing created a strategy for encryption and decryption of color image information and touched on just the premise of keys. In this plan, keys and the agreement of Hill Cipher (HC) are basic. Moreover, keys multiplication (pre or post) over an RGB image information framework is inevitable to know to effectively decrypt the first image information. We have given a machine simulation with a standard …
Construction Of Energy Preserving Qmf, Jian-Ao Lian, Yonghui Wang
Construction Of Energy Preserving Qmf, Jian-Ao Lian, Yonghui Wang
Applications and Applied Mathematics: An International Journal (AAM)
Recently, a family of perfect reconstruction (PR) quadrature mirror filterbanks (QMF) with finite impulse response filters (FIR) from systems of biorthogonal refinable functions and wavelets were introduced and also applied to image processing. However, a detailed procedure was absent. The main objective of this paper is to present extensive examples that will provide a thorough process of construction of the new family of PR QMF with FIR filterbanks. These new filters are linearphase due to the symmetry property of their corresponding biorthogonal refinable functions and wavelets. In addition, these filters have odd lengths so that the symmetric extension can be …
Priority Queueing System With A Single Server Serving Two Queues M[X1],M[X2]/G1,G2/1 With Balking And Optional Server Vacation, G. Ayyappan, P. Thamizhselvi
Priority Queueing System With A Single Server Serving Two Queues M[X1],M[X2]/G1,G2/1 With Balking And Optional Server Vacation, G. Ayyappan, P. Thamizhselvi
Applications and Applied Mathematics: An International Journal (AAM)
In this paper we study a vacation queueing system with a single server simultaneously dealing with an M[x1] /G1/1 and an M[x2] /G2/1 queues. Two classes of units, priority and non-priority, arrive at the system in two independent compound Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority and non-priority units. We further assume that the server may take a vacation of random length just after serving the last customer in the priority unit present in the system. If the server …
Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook
Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook
Mathematics: Student Scholarship & Creative Works
While other sports have statisticians to evaluate players and their stats, in electronic sports there is a need for statisticians to evaluate different parts of the game. League of Legends is the most popular of ESports and is the focus of this discussion. The mechanic of focus here is runes which give boosts to the players stats in-game like being able to do extra damage. We will be finding the effectiveness of these runes by looking at gold efficiency, help with last hitting, and extra damage dealt through the use of Python.
Teaching Numerical Methods In The Context Of Galaxy Mergers, Maria Kourjanskaia
Teaching Numerical Methods In The Context Of Galaxy Mergers, Maria Kourjanskaia
Physics
Methods of teaching numerical methods to solve ordinary differential equations in the context of galaxy mergers were explored. The research published in a paper by Toomre and Toomre in 1972 describing the formation of galactic tails and bridges from close tidal interactions was adapted into a project targeting undergraduate physics students. Typically undergraduate physics students only take one Computational Physics class in which various techniques and algorithms are taught. Although it is important to study computational physics techniques, it is just as important to apply this knowledge to a problem that is representative of what computational physics researchers are investigating …
Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang
Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang
COBRA Preprint Series
Non-negative matrix factorization (NMF) is a widely used machine learning algorithm for dimension reduction of large-scale data. It has found successful applications in a variety of fields such as computational biology, neuroscience, natural language processing, information retrieval, image processing and speech recognition. In bioinformatics, for example, it has been used to extract patterns and profiles from genomic and text-mining data as well as in protein sequence and structure analysis. While the scientific performance of NMF is very promising in dealing with high dimensional data sets and complex data structures, its computational cost is high and sometimes could be critical for …
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Publications
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
Factorized Runge-Kutta-Chebyshev Methods, Stephen O'Sullivan
Factorized Runge-Kutta-Chebyshev Methods, Stephen O'Sullivan
Conference papers
The second-order extended stability Factorized Runge-Kutta-Chebyshev (FRKC2) class of explicit schemes for the integration of large systems of PDEs with diffusive terms is presented. FRKC2 schemes are straightforward to implement through ordered sequences of forward Euler steps with complex stepsizes, and easily parallelised for large scale problems on distributed architectures.
Preserving 7 digits for accuracy at 16 digit precision, the schemes are theoretically capable of maintaining internal stability at acceleration factors in excess of 6000 with respect to standard explicit Runge-Kutta methods. The stability domains have approximately the same extents as those of RKC schemes, and are a third longer …
General Solution Of The Wind Triangle Problem And The Critical Tailwind Angle, Nihad E. Daidzic
General Solution Of The Wind Triangle Problem And The Critical Tailwind Angle, Nihad E. Daidzic
Aviation Department Publications
A general analytical solution of the navigational wind-triangle problem and the calculation of the critical tailwind angle are presented in this study among other findings. Any crosswind component will effectively create a headwind component on fixed course tracks. The meaning of a route track is lost with excessive crosswinds representing the bifurcation point between the possible and the impossible navigational solutions. Any wind of constant direction and speed will effectively reduce groundspeed and increase time-of-flight on closed-loop multi-segment flights. Effective wind track component consists, in general, of true and induced components. The average groundspeed of multiple-leg flights is a harmonic …
Stereographic Visualization Of Bose-Einstein Condensate Clouds To Measure The Gravitational Constant, Ed Wesley Wells
Stereographic Visualization Of Bose-Einstein Condensate Clouds To Measure The Gravitational Constant, Ed Wesley Wells
College of Graduate Studies: Theses & Dissertations
This thesis describes a set of tools that can be used for the rapid design of atom interferometer schemes suitable for measuring Newton's Universal Gravitation constant also known as "Big G". This tool set is especially applicable to Bose--Einstein--condensed systems present in NASA's Cold Atom Laboratory experiment to be deployed to the International Space Station in 2017. These tools include a method of approximating the solutions of the nonlinear Schrödinger or Gross--Pitaevskii equation (GPE) using the Lagrangian Variational Method. They also include a set of software tools for translating the approximate solutions of the GPE into images of the optical …
Simulation Of Nuclear Fusion Using A One Dimensional Particle In Cell Method, Steven T. Margell
Simulation Of Nuclear Fusion Using A One Dimensional Particle In Cell Method, Steven T. Margell
Cal Poly Humboldt theses and projects
In this thesis several novel techniques are developed to simulate fusion events in an isotropic, electrostatic three-dimensional Deuterium-Tritium plasma. These techniques allow us to accurately predict three-dimensional collision events with a one-dimensional model while simultaneously reducing compute time via a nearest neighbor algorithm. Furthermore, a fusion model based on first principles is developed that yields an average fusion reactivity which correlates well with empirical results.
Stability Condition Of A Retrial Queueing System With Abandoned And Feedback Customers, Amina A. Bouchentouf, Abbes Rabhi, Lahcene Yahiaoui
Stability Condition Of A Retrial Queueing System With Abandoned And Feedback Customers, Amina A. Bouchentouf, Abbes Rabhi, Lahcene Yahiaoui
Applications and Applied Mathematics: An International Journal (AAM)
This paper deals with the stability of a retrial queueing system with two orbits, abandoned and feedback customers. Two independent Poisson streams of customers arrive to the system, and flow into a single-server service system. An arriving one of type i; i = 1; 2, is handled by the server if it is free; otherwise, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. The customer in the orbit either attempts service again after a random time or gives up receiving service and leaves the system …
Group Decision Making Using Comparative Linguistic Expression Based On Hesitant Intuitionistic Fuzzy Sets, Ismat Beg, Tabasam Rashid
Group Decision Making Using Comparative Linguistic Expression Based On Hesitant Intuitionistic Fuzzy Sets, Ismat Beg, Tabasam Rashid
Applications and Applied Mathematics: An International Journal (AAM)
We introduce a method for aggregation of experts’ opinions given in the form of comparative linguistic expression. An algorithmic form of technique for order preference is proposed for group decision making. A simple example is given by using this method for the selection of the best alternative as well as ranking the alternatives from the best to the worst.
Analysis Of Repairable M[X]/(G1,G2)/1 - Feedback Retrial G-Queue With Balking And Starting Failures Under At Most J Vacations, P. Rajadurai, M. C. Saravanarajan, V. M. Chandrasekaran
Analysis Of Repairable M[X]/(G1,G2)/1 - Feedback Retrial G-Queue With Balking And Starting Failures Under At Most J Vacations, P. Rajadurai, M. C. Saravanarajan, V. M. Chandrasekaran
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of service and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them join into the orbit. The negative customer, arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters into the orbit or leaves the system. If the orbit is empty at the service completion of each type …
A Note On An M/M/S Queueing System With Two Reconnect And Two Redial Orbits, Amina A. Bouchentouf, Hanane Sakhi
A Note On An M/M/S Queueing System With Two Reconnect And Two Redial Orbits, Amina A. Bouchentouf, Hanane Sakhi
Applications and Applied Mathematics: An International Journal (AAM)
A queueing system with two reconnect orbits, two redial (retrial) orbits, s servers and two independent Poisson streams of customers is considered. An arriving customer of type i, i = 1, 2 is handled by an available server, if there is any; otherwise, he waits in an infinite buffer queue. A waiting customer of type i who did not get connected to a server will lose his patience and abandon after an exponentially distributed amount of time, the abandoned one may leave the system (lost customer) or move into one of the redial orbits, from which he makes a new …
Analysis Of Repairable M[X]/(G1,G2)/1 - Feedback Retrial G-Queue With Balking And Starting Failures Under At Most J Vacations, P. Rajadurai, M. C. Saravanarajan, V. M. Chandrasekaran
Analysis Of Repairable M[X]/(G1,G2)/1 - Feedback Retrial G-Queue With Balking And Starting Failures Under At Most J Vacations, P. Rajadurai, M. C. Saravanarajan, V. M. Chandrasekaran
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of services and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them get into the orbit. The negative customer, is arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters the orbit or leaves the system. If the orbit is empty at the service completion of each type …
Modeling Traffic At An Intersection, Kaleigh L. Mulkey, Saniita K. Fasenntao
Modeling Traffic At An Intersection, Kaleigh L. Mulkey, Saniita K. Fasenntao
Symposium of Student Scholars
The main purpose of this project is to build a mathematical model for traffic at a busy intersection. We use elements of Queueing Theory to build our model: the vehicles driving into the intersection are the “arrival process” and the stop light in the intersection is the “server.”
We collected traffic data on the number of vehicles arriving to the intersection, the duration of green and red lights, and the number of vehicles going through the intersection during a green light. We built a SAS macro code to simulate traffic based on parameters derived from the data.
In our program …
Efficient Thermal Image Segmentation Through Integration Of Nonlinear Enhancement With Unsupervised Active Contour Model, Fatema Albalooshi, Evan Krieger, Paheding Sidike, Vijayan K. Asari
Efficient Thermal Image Segmentation Through Integration Of Nonlinear Enhancement With Unsupervised Active Contour Model, Fatema Albalooshi, Evan Krieger, Paheding Sidike, Vijayan K. Asari
Electrical and Computer Engineering Faculty Publications
Thermal images are exploited in many areas of pattern recognition applications. Infrared thermal image segmentation can be used for object detection by extracting regions of abnormal temperatures. However, the lack of texture and color information, low signal-to-noise ratio, and blurring effect of thermal images make segmenting infrared heat patterns a challenging task. Furthermore, many segmentation methods that are used in visible imagery may not be suitable for segmenting thermal imagery mainly due to their dissimilar intensity distributions.
Thus, a new method is proposed to improve the performance of image segmentation in thermal imagery. The proposed scheme efficiently utilizes nonlinear intensity …
Singular Value Computation And Subspace Clustering, Qiao Liang
Singular Value Computation And Subspace Clustering, Qiao Liang
Theses and Dissertations--Mathematics
In this dissertation we discuss two problems. In the first part, we consider the problem of computing a few extreme eigenvalues of a symmetric definite generalized eigenvalue problem or a few extreme singular values of a large and sparse matrix. The standard method of choice of computing a few extreme eigenvalues of a large symmetric matrix is the Lanczos or the implicitly restarted Lanczos method. These methods usually employ a shift-and-invert transformation to accelerate the speed of convergence, which is not practical for truly large problems. With this in mind, Golub and Ye proposes an inverse-free preconditioned Krylov subspace method, …
Parameters Estimation Of Material Constitutive Models Using Optimization Algorithms, Kiswendsida Jules Kere
Parameters Estimation Of Material Constitutive Models Using Optimization Algorithms, Kiswendsida Jules Kere
Williams Honors College, Honors Research Projects
Optimization Algorithms are very useful for solving engineering problems. Indeed, optimization algorithms can be used to optimize engineering designs in terms of safety and economy. Understanding the proprieties of materials in engineering designs is very important in order to make designs safe. Materials are not really perfectly homogeneous and there are heterogeneous distributions in most materials. In this paper, Self-OPTIM which is an inverse constitutive parameter identification framework will be used to identify parameters of a linear elastic material constitutive model. Data for Self-OPTIM will be obtained using ABAQUS simulation of a dog-bone uniaxial test. Optimization Algorithms will be used …
Delay Analysis Of A Discrete-Time Non-Preemptive Priority Queue With Priority Jumps, Deepak C. Pandey, Arun K. Pal
Delay Analysis Of A Discrete-Time Non-Preemptive Priority Queue With Priority Jumps, Deepak C. Pandey, Arun K. Pal
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state and also for some performance measures such as the mean value of the system contents and the packet delay. The behavior of the priority queues with priority jumps will be illustrated by …
Generating Combinatorial Objects- A New Perspective, Alexander Chizoma Nwala
Generating Combinatorial Objects- A New Perspective, Alexander Chizoma Nwala
Computer Science Theses & Dissertations
Combinatorics is the science of "possibilities." This definition, while not formal is a fair statement because all too often, in order to gain insight into the solution of many counting problems, we explore the possibilities. In some cases we seek to know how many options, while in other cases we seek to enumerate or list the options. Irrespective of the scenario, combinatorics plays a vital role today. In many instances such as exploring the options for choosing a new password for a combination lock, we employ combinatorics. In considering the possible license plate permutations for a state, or to see …
A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky
A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky
Publications
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having O(n2) complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we …