User talk:Lavaka

Hi, Lavaka, Welcome to Wikipedia!

I hope you like this place — I sure do — and want to stay. Before getting too in-depth, you may want to read about the Five pillars of Wikipedia and simplified ruleset. If you need help on how to title new articles check out the naming conventions, and for help on formatting the pages visit the manual of style. If you need help look at Wikipedia:Help and the FAQ , plus if you can't find your answer there, check the Village Pump (for Wikipedia related questions) or the Reference Desk (for general questions)! There's still more help at the Tutorial and Policy Library. Plus, don't forget to visit the Community Portal. And if you have any more questions after that, feel free to post them on my user talk page or place {{helpme}} on your talk page and someone will be by to help you shortly.

Additional tips

Here's some extra tips to help you get around in the 'pedia!

If you want to play around with your new Wiki skills the Sandbox is for you.
You can sign your name using three tildes (~). If you use four, you can add a datestamp too. Five will get you the datestamp only.
You may want to add yourself to the new user log.
If you ever think a page or image should be deleted, please list it at the votes for deletion page. There is also a votes for undeletion page if you want to retrieve something that you think should not have been deleted.
If you're still entirely confused, or would like to get a better grasp of your wikipedia skills, and you have an IRC client (or don't mind getting one), check out the Bootcamp. It's not what it sounds like, but it is fun and can help you with your editing skills.
If you're bored and want to find something to do, try the Random page button in the sidebar, or check out the Open Task message in the Community Portal.

Happy Wiki-ing. —Kf4bdy ^talk ^contribs

PS: This is not a bot and you did nothing to prompt this message. This is just a friendly welcome by a fellow Wikipedian.

Click here to respond to this message!

"See also" section

Hello, and also a warm welcome from me. I came across some of your contributions to the mathematics pages, leading me to think that you might be interested in Wikipedia:WikiProject Mathematics.

I was prompted by your edit to Circulant matrix to draw your attention to some of the more obscure customs on Wikipedia. The "See also" section should only contain link to articles which are not mentioned in the text. Ideally, all related articles are already mentioned and thus there is no need for a "See also" section (see Wikipedia:Guide to layout#See also for the official version). Incidentally, we don't like capitals here and we write "See also" instead of "See Also" (see Wikipedia:Manual of Style (headings)#Capitalization).

Don't worry too much about it, nobody knows all the rules. Feel free to ask me if you have any questions. I hope to see you around, and that you enjoy Wikipedia.

All the best, Jitse Niesen (talk) 07:31, 6 October 2006 (UTC)[reply]

DCT

Regarding the comment you left on my Talk page, the image and text in the DCT article are correct as-is. The DCT-II is equivalent to a real-even DFT of length 4N consisting of the original DCT data mirrored and interleaved with zeros. The DCT-III is equivalent to a real-even DFT of length 4N consisting of the original DCT data mirrored twice (once with flipped sign), and no interleaved zeros (except for a couple of inserted zero points at the odd-symmetry points).

—Steven G. Johnson (talk) 20:19, 26 January 2008 (UTC)[reply]

Bessel function closure relation

Can you clarify your comment about this equation 'not existing as an integral relation'?

\int _{0}^{\infty }xJ_{\alpha }(ux)J_{\alpha }(vx)dx={\frac {1}{u}}\delta (u-v)

Does this mean there is no rigorous form of

$\int _{-\infty }^{\infty }e^{ikx}dx=2\pi \delta (k)$ either? Metterklume (talk) 04:10, 4 March 2009 (UTC)[reply]

Real normal matrices

Hi Lavaka, re your changes to Eigendecomposition of a matrix, a real normal matrix need not have N linearly independent real eigenvectors -- consider a rotation by 90° in $\mathbb {R} ^{2}$ . Your edited version is incorrect as it stands; it says that this rotation can be decomposed with a real $\mathbf {\Lambda }$ , which is clearly wrong. I believe the section about symmetric matrices was meant to be about what happens when you work in $\mathbb {R} ^{n}$ (where there are no complex eigenvectors), so I reverted your edit and instead changed "has N linearly independent eigenvectors" to "has N real linearly independent eigenvectors" -- hope that's ok. Benja (talk) 18:43, 10 June 2010 (UTC)[reply]

Semidefinite and linear optimization

In convex minimization computations, semidefinite programming (SDP) extends linear programming. However, in convex analysis theory, semidefinite programming is a special case of linear programming on a vector space; this is discussed in Borwein & Lewis's textbook (chapter 4.5, if my memory is correct) and in Nesterov & Nemirovskii's monograph.

Since abstract linear programming would interest few WP readers, I agree that semidefinite programming best belongs in the convex minimization section of the footer.

Best regards, Kiefer.Wolfowitz (talk) 22:32, 9 December 2010 (UTC)[reply]

great, agreed then on the move. I wouldn't really say that semidefinite programming is a special case of linear programming on a vector space; rather, I would say that it is a special case of cone programming, using the semidefinite cone (where as linear programming using the positive orthant cone). Lavaka (talk) 22:40, 9 December 2010 (UTC)[reply]

Disambiguation link notification for April 7

Hi. When you recently edited Dykstra's projection algorithm, you added links pointing to the disambiguation pages Projection and Convex (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 10:53, 7 April 2012 (UTC)[reply]

L-BFGS

Hello, Lavaka. You have new messages at Qwertyus's talk page.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

Disambiguation link notification for October 9

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that you've added some links pointing to disambiguation pages. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

Projections onto Convex Sets (check to confirm | fix with Dab solver)

added links pointing to Converge, Projection, Intersection, Convex and Closed

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:38, 9 October 2012 (UTC)[reply]

Disambiguation link notification for January 24

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Legendre transformation, you added a link pointing to the disambiguation page Convexity (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:19, 24 January 2013 (UTC)[reply]

ArbCom elections are now open!

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 13:45, 23 November 2015 (UTC)[reply]