0
Linear Algebra
Linear algebra is the detailed study of vector spaces. With applications in such disparate fields as sociology, economics, computer programming, chemistry, and physics, including its essential role in mathematically describing quantum mechanics and the theory of relativity, linear algebra has become one of the most essential mathematical disciplines for the modern world. Please direct all questions regarding matrices, determinants, eigenvalues, eigenvectors, and linear transformations into this category.
2,176 Questions
What will the next three numbers be in the lottery tonight?
301 i know because i can see the future i predicted the rise of hitler and osama bin laden
How would you show that fewer than 66 people attended something in inequality form?
a<66 or 66>a.
The letter can be any you chose. But the symbol is chosen dependent on which side it is on. < Means "is less than" and > means "is greater than."
How do you show a variance matrix is nonnegative definite?
I assume you mean covariance matrix and I assume that you are familiar with the definition:
C = E[(X-u)(X-u)T]
where X is a random vector and u = E(X) is the mean
The definition of non-negative definite is:
xTCx ≥ 0 for any vector x Є R
So is xTE[(X-u)(X-u)T]x ≥ 0?
Then, from one of the covariance properties:
E[(xT(X-u))((X-u)Tx)] = E[xT([(X-u)(X-u)T]x)] = E[((xTI)x)] = E[xTx]
Finally, since we've already defined x to have only real values, xTx is therefore non-negative definite by definition.
Can linear system that has more unknowns than equation be consistent?
yes it can . the system may have infinitely many solutions.
If the product of two matrices is the identity matrix they are?
If the product of two matrices is the identity matrix then one matrix is the inverse or reciprocal of the other matrix.
EXAMPLE
A =(4 1) A-1 = (0.3 -0.1) then AA-1 = (1 0)
.....(2 3)......... (-0.2 0.4)................... (1 1)
The dots simply maintain the spacing and serve no other purpose.
What Reduces an equation that has two variables to an equation that has one variable?
Substitution........apex
How many solutions does a system of linear equations have if it is inconsistant?
A set of equations is inconsistent, if its solution set is empty.
How do you graph the linear equation 3x plus y equals -4?
3x + y = -4 -3x -3x y = - 4 -3x now plug in points!
+++
To clarify the principle, re-arrange the equation so it reads as "y = [something done to x]" then calculate a table of points for the plot itself.
In computer science, relational algebra is an offshoot of first-order logic and of algebra of sets concerned with operations over finitary relations, usually made more convenient to work with by identifying the components of a tuple by a name (called attribute) rather than by a numeric column index, which is what is called a relation in database terminology.
The main application of relational algebra is providing a theoretical foundation for relational databases, particularly query languages for such databases, chiefly among which is SQLRelational algebra received little attention outside of pure mathematics until the publication of E.F. Codd's relational model of data in 1970. Codd proposed such an algebra as a basis for database query languages. (See section Implementations.)
Both a named and a unnamed perspective are possible for relational algebra, depending on whether the tuples are endowed with component names or not. In the unnamed perspective, a tuple is simply a member of a Cartesian product. In the named perspective, tuples are functions from a finite set U of attributes (of the relation) to a domain of values (assumed distinct from U).[1] The relational algebras obtained from the two perspectives are equivalent.[2] The typical undergraduate textbooks present only the named perspective though,[3][4] and this article follows suit.
Relational algebra is essentially equivalent in expressive power to relational calculus (and thus first-order logic); this result is known as Codd's theorem. One must be careful to avoid a mismatch that may arise between the two languages because negation, applied to a formula of the calculus, constructs a formula that may be true on an infinite set of possible tuples, while the difference operator of relational algebra always returns a finite result. To overcome these difficulties, Codd restricted the operands of relational algebra to finite relations only and also proposed restricted support for negation (NOT) and disjunction (OR). Analogous restrictions are found in many other logic-based computer languages. Codd defined the term relational completeness to refer to a language that is complete with respect to first-order predicate calculus apart from the restrictions he proposed. In practice the restrictions have no adverse effect on the applicability of his relational algebra for database purposes.
AggregationFurthermore, computing various functions on a column, like the summing up its elements, is also not possible using the relational algebra introduced insofar. There are five aggregate functions that are included with most relational database systems. These operations are Sum, Count, Average, Maximum and Minimum. In relational algebra the aggregation operation over a schema (A1, A2, ... An) is written as follows:
G1, G2, ..., Gm g f1(A1'), f2(A2'), ..., fk(Ak') (r)
where each Aj', 1 ≤ j ≤ k, is one of the original attributes Ai, 1 ≤ i ≤ n.
The attributes preceding the g are grouping attributes, which function like a "group by" clause in SQL. Then there are an arbitrary number of aggregation functions applied to individual attributes. The operation is applied to an arbitrary relation r. The grouping attributes are optional, and if they are not supplied, the aggregation functions are applied across the entire relation to which the operation is applied.
Let's assume that we have a table named Account with three columns, namely Account_Number, Branch_Name and Balance. We wish to find the maximum balance of each branch. This is accomplished by Branch_NameGMax(Balance)(Account). To find the highest balance of all accounts regardless of branch, we could simply write GMax(Balance)(Account).
Transitive closureAlthough relational algebra seems powerful enough for most practical purposes, there are some simple and natural operators on relations which cannot be expressed by relational algebra. One of them is the transitive closure of a binary relation. Given a domain D, let binary relation R be a subset of D×D. The transitive closure R+ of R is the smallest subset of D×D containing R which satifies the following condition:There is no relational algebra expression E(R) taking R as a variable argument which produces R+. This can be proved using the fact that, given a relational expression E for which it is claimed that E(R) = R+, where R is a variable, we can always find an instance r of R (and a corresponding domain d) such that E(r) ≠r+.[15]
SQL however officially supports such fixpoint queries since 1999, and it had vendor-specific extensions in this direction well before that.
Do similar matrices have the same eigenvectors?
No, in general they do not. They have the same eigenvalues but not the same eigenvectors.
What is the ''time complexity'' of matrix multiplication?
i hope so its answer will be o(n) due to parallel computation.
using mpi we have to communicate one process to the another so mostly it will be like tat....
not sure...
What is superphosphate fertilizers?
a naturally slow release phosphate fertilizer. plants need three major nutrients: nitrogen, phosphate, and potash (potassium) or NPK for short.
Super phosphate is a fertilizer produced by the action of concentrated sulfuric acid H2SO4
on powdered phosphate rock. Ca3(PO4). Calcium sulphate and calcium phosphate is yielded.
3 Ca3(PO4)2 + 6 H2SO4 → 6 CaSO4 + 3 Ca(H2PO4)2
Tomato plants and any flowering plant can use 1/3 more super phosphate if you are using NPK 10 10 10. Apply on the surface of the soil and it will be slow acting dissolving into the soil over a six month period with normal watering. The extra phosphate will also help build a stronger root and trunk system. In addition to adding phosphate it adds calcium, and sulfur to your garden soil. Since the phosphate rock it is made from is not pure it adds magnesium, manganese, copper, iron and other minor elements to your soil. The reaction with water is slightly acid. Your garden should be checked once a month for Ph, nitrogen, phosphate and potassium. Cheap test kits can be bought at your garden store.
Were does the Venus's fly trap live?
In its natural habitat, the Venus flytrap prefers savanna plains, where there are few trees and bushes, like those found in North and South Carolina. Here the plants often grow surrounded by grasses and other carnivorous plants. The plants grow in a variety of soil types such as peat, sand, or loam. With an acid pH of between 4 and 5.
Distinctivley the plants originate in soils which are lacking in Nitrogen, the insect catching behaviour is an adaption to provide the plant with this element.
The Venus flytrap can withstand full sun but only in soil with a high moisture content. Plants are perennial and are able to withstand temperatures of -10F, but in their natural habitat the temperature rarely falls below 32F.
What does borrowing 20 thousand dollars at simple interest rate of 8.9 per cent for 72 months mean?
Simple interest is calculated: Interest= Principle X Rate X Time. In this case Interest= 20000 X .089 X 6 (72 months= 6 yrs) which equals $10680 in interest. You would owe/pay $30680 at the end of the 72 months.
#include <stdio.h>
#include<conio.h>void main()
{
int a[10][10],rows,cols:");
clrscr();
printf("enter the rows and cols:");
scanf("%d%d",&rows,&cols")
printf("enter the elements into the array:");
for(i=0;i<rows;i++)
for(j=0;j<cols;j++)
scanf("%d",&a[i][j]);
printf("the transpose is:");
for("i=0;i<rows;i++)
{
for(j=o;j<cols;j++)
{
printf("%d",a[j][i]);
}
printf("\n");
}getch();
}
Dragonware is almost entirely Japanese and was made by many different companies. It is pottery or porcelain that usually has a raised moriage dragon on it, usually surrounded by wisps of smoke. The technique used to apply the moriage decoration to them is called slipwork. Dragonware originally was made by Nippon in the late 1800's, and is still being made today. However, there are very large differences in the quality of the pieces, so with practice, the era's are pretty easy to distinguish. The original Nippon pieces have extremely ornate and very detailed large dragons, that wrap around most of the piece. They usually have lots of enamel work around the edges of the item. They also originally had glass beads for the dragon's eyes, rather than the typical slipwork ones. The new Dragonware is also easily recognized, as the dragons are extremely undetailed and appear slapped on and hardly wrap around at all compared to any of the older Dragonware pieces. The souvenir pieces fit into the new category. There are many little differences and changes to the dragons as the years went by, which helps make dating them a little easier. Pieces that have enamel work around the edges, are typically older than pieces that do not. They slowly stopped the enamel detail as the years went by.
There are also other design techniques that are used on Dragonware instead of the more common moriage. They include: Satsuma pieces with the moriage dragons - they look just like the moriage Dragonware, but have a Satsuma design as well with enameled handles, Coralene - tiny glass beads are applied to an enamel design and then heated, making the finished design look like coral, Enamel - a hard glossy paint, and finally a flat dragon design of either gold or colored paint that is also considered Dragonware and appears the same as other Dragonware pieces, except that the dragon design is flat instead of raised. Many different colors were used on Dragonware items. The most common being the Smokey Grey/White or Black/White. Other colors include: Deep Blue, Pastel Blue, Red, Orange, Pastel Green, White/Gold, Brown and Chocolate. There are also some colors that are always the newer low-quality undetailed Dragonware, and were not made in the older pieces. These include: Pink, Bright Green, Purple and Yellow. There are also some new pieces made in a few of the older colors. Also, any piece with a souvenir scene is always new.
Typically Dragonware was made as table items, smoking sets or for decoration. This includes many pieces such as vases, tea sets, saki sets, ashtrays, plates, cups and saucers, condiment sets, wall pockets, incense burners and lamps to name a few. Some of the teacups will have a lithophane inside the bottom of them. This is a raised design, usually of a woman's face or full body, known as a Geisha. It can be seen clearly when held up to the light. The Geisha adds value to a teacup, with the nude Geisha being harder to find and the most valuable.
Sir i want to do MBA correspondance from symbosis pune. please tell you about admission procedure fee charges for private MBA?
Regard
Manish
I want to know the Patnaiks history?
I am also intrested in the patnaik history because apparently I am part of them. As far as I can tell the Patnaiks can be traced as far back as Orissa. There are many who have immigrated to Andhra Pradesh and from there to the U.S
there are many different types of matrix math voids. Visit this site to get info:http://lib3ds.sourceforge.net/a00097.html
What are the kinds of relation in mathematics?
1. One to One -function-
2. One to Many -relation-
3. Many to Many -function-
What is a dependable variable?
Dependable variable is a term used in mathematics. Essentially, it is an element that changes it's value depending on the values of other elements.
Program to display multiplication of two matrix?
The matrix multiplication in c language : c program is used to multiply matrices with two dimensional array. This program multiplies two matrices which will be entered by the user.
